4 problems
Let be a random -regular bipartite graph, and let be the partition function of the anti-ferromagnetic -state Potts model on . Random-regular-grap…
Let be a maximum-degree bound, let , and consider graphs of maximum degree at most . A -list packing assigns colors from each vertex's list so tha…
Bounded-complexity rapid-mixing conjecture. The Markov chain is rapidly mixing for every .
Mossel–Weitz–Wormald conjecture. Unless , there does not exist a fully polynomial approximation scheme for the partition function of the hardcore model wit…