\(H\)-coloring tori
From MaRDI portal
Publication:713976
DOI10.1016/j.jctb.2012.05.003zbMath1257.05041arXiv1101.0840MaRDI QIDQ713976
Publication date: 19 October 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.0840
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Independent sets in the hypercube revisited, Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$, Homomorphisms from the torus, Rigidity of 3-colorings of the discrete torus, Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018, The number of 4-colorings of the Hamming cube, Independent sets in the middle two layers of Boolean lattice, Rigidity of proper colorings of \(\mathbb{Z}^d \), Lipschitz Functions on Expanders are Typically Flat, On independence and entropy for high-dimensional isotropic subshifts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(H\)-colouring bipartite graphs
- Some intersection theorems for ordered sets and graphs
- Edge-isoperimetric inequalities in the grid
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- Graph homomorphisms and phase transitions
- On random graph homomorphisms into \({\mathbb{Z}}\)
- Uniqueness of uniform random colorings of regular trees
- High-dimensional Lipschitz functions are typically flat
- Sampling 3-colourings of regular bipartite graphs
- Bounding the partition function of spin-systems
- A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
- On Counting Independent Sets in Sparse Graphs
- Sampling independent sets in the discrete torus
- On weighted graph homomorphisms
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Probability Inequalities for Sums of Bounded Random Variables
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
- Prescribing a System of Random Variables by Conditional Distributions
- Range of cube-indexed random walk
