Add to ORKGWe determine the asymptotic behaviour of the chromatic number of exchangeable random graphs defined by step-regulated graphons. Furthermore, we show that the upper bound holds for a general graphon. We also extend these results to sparse random graphs obtained by percolations on graphons
Let G=G(n,m) be a random graph whose average degree d=2m/n is below the k-colorability threshold. If...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the comp...
AbstractIn this work we show that with high probability the chromatic number of a graph sampled from...
International audienceIn this paper we study the set chromatic number of a random graph G(n, p) for ...
We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph ...
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings o...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large compl...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
Let G=G(n,m) be a random graph whose average degree d=2m/n is below the k-colorability threshold. If...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the comp...
AbstractIn this work we show that with high probability the chromatic number of a graph sampled from...
International audienceIn this paper we study the set chromatic number of a random graph G(n, p) for ...
We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph ...
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings o...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
AbstractWhen we wish to compute lower bounds for the chromatic number χ(G) of a graph G, it is of in...
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large compl...
International audienceIn this paper, the on-line list colouring of binomial random graphs G (n, p) i...
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points of...
Let G=G(n,m) be a random graph whose average degree d=2m/n is below the k-colorability threshold. If...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the comp...