4 citations · 8 across the 6 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2024
The clique chromatic number of sparse random graphs
Manuel Fernandez, Lutz Warnke
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of ma…
math.CO2022★ 2 cited
On the concentration of the chromatic number of random graphs
Erlang Surya, Lutz Warnke
Shamir and Spencer proved in the 1980s that the chromatic number of the binomial random graph G(n,p) is concentrated in an interval of length at most ω\sqrt{n}, and in the 1990s Al…
math.CO2008★ 4 cited
On the concentration of the chromatic number of random graphs
Alex Scott
Let 0<p<1 be fixed. Shamir and Spencer proved in the 1980s that the chromatic number of a random graph in G(n,p) is concentrated in an interval of length about n^{1/2}. In this exp…