The asymptotic cluster-weight conjecture for H-coloring tori
The asymptotic cluster-weight conjecture for H-coloring tori
Let be a graph, let be a vector of vertex weights, and let be even. Write for the set of -colorings of the -ary -dimensional torus, let be the set of dominant pairs, and let , , and have the meanings introduced above. The asymptotic cluster-weight conjecture. For all , , and even , there is a decomposition of satisfying the conditions of the structural theorem and, for every , satisfying
as . The conjecture is known for the hard-core model on with all positive activities, and for proper -colorings of , but is open in general.
Sources & referencesView supporting material
Primary source
John Engbers and David Galvin, “H-coloring tori”, arXiv:1101.0840 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.