Let G=G(n,m) be a random graph whose average degree d=2m is below the k-colorability threshold. If we sample a k-coloring Sigma of G uniformly at random, what can we say about the correlations between the colors assigned to vertices that are far apart?
展开▼
