Sampling 3-colourings of regular bipartite graphs
From MaRDI portal
Publication:2461977
DOI10.1214/EJP.v12-403zbMath1126.05048arXiv1206.3202OpenAlexW2135678036MaRDI QIDQ2461977
Publication date: 23 November 2007
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3202
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
Approximately counting independent sets in bipartite graphs via graph containers ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ The Growth Constant of Odd Cutsets in High Dimensions ⋮ Tunneling behavior of Ising and Potts models in the low-temperature regime ⋮ \(H\)-coloring tori ⋮ Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$
This page was built for publication: Sampling 3-colourings of regular bipartite graphs