83 citations · 118 across the 3 of their papers we have counts for
1 paper · 2 filters
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
Let G=G(n,m) be a random graph whose average degree d=2m/n is below the k-colorability threshold. If we sample a k-coloring σ of G uniformly at random, what can we say…