The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
From MaRDI portal
Publication:518178
DOI10.1016/J.EJC.2016.11.003zbMath1358.05145arXiv1606.03718OpenAlexW2963328211MaRDI QIDQ518178
Prasad Tetali, Emma Cohen, Will Perkins, Péter Csikvári
Publication date: 28 March 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03718
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ Counting independent sets in cubic graphs of given girth ⋮ The number of independent sets in an irregular graph ⋮ A reverse Sidorenko inequality
Cites Work
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Two approaches to Sidorenko’s conjecture
- The Bipartite Swapping Trick on Graph Homomorphisms
- The Number of Independent Sets in a Regular Graph
- On weighted graph homomorphisms
- Maximizing H‐Colorings of a Regular Graph
- Independent sets, matchings, and occupancy fractions
- On the Widom–Rowlinson Occupancy Fraction in Regular Graphs
This page was built for publication: The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
