52 citations · 130 across the 20 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2015
Local convergence of random graph colorings
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
Let be a random graph whose average degree is below the -colorability threshold. If we sample a -coloring of uniformly at random, what can we say…
math.CO2013★ 6 cited
On the chromatic number of random regular graphs
Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich
Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if…