Local Convergence of Random Graph Colorings
Sign Up to like & getrecommendations! Published in 2018 at "Combinatorica"
DOI: 10.1007/s00493-016-3394-x
Abstract: 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… read more here.
Keywords: local convergence; convergence random; graph colorings; random graph ... See more keywords