Add to ORKGInternational audienceIn this paper we study the set chromatic number of a random graph G(n, p) for a wide range of p = p(n). We show that the set chromatic number, as a function of p, forms an intriguing zigzag shape
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph ...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
We determine the asymptotic behaviour of the chromatic number of exchangeable random graphs defined ...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
AbstractIn this work we show that with high probability the chromatic number of a graph sampled from...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph ...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
We determine the asymptotic behaviour of the chromatic number of exchangeable random graphs defined ...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
AbstractIn this work we show that with high probability the chromatic number of a graph sampled from...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...