On the Widom–Rowlinson Occupancy Fraction in Regular Graphs

DOI10.1017/S0963548316000249zbMath1371.05182arXiv1512.06398OpenAlexW2963760054MaRDI QIDQ5366940

Will Perkins, Emma Cohen, Prasad Tetali

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06398

zbMATH Keywords

Widom-Rowlinson model\(d\)-regular graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Counting proper colourings in 4-regular graphs via the Potts model ⋮ The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph ⋮ Low-temperature behavior of the multicomponent Widom-Rowlison model on finite square lattices ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Counting independent sets in cubic graphs of given girth ⋮ A reverse Sidorenko inequality

Cites Work

• Unnamed Item
• The analysis of the Widom-Rowlinson model by stochastic geometric methods
• Factor models on locally tree-like graphs
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Bipartite Swapping Trick on Graph Homomorphisms
• The Number of Independent Sets in a Regular Graph
• Graph operations and upper bounds on graph homomorphism counts
• On weighted graph homomorphisms
• Maximizing H‐Colorings of a Regular Graph
• Independent sets, matchings, and occupancy fractions

This page was built for publication: On the Widom–Rowlinson Occupancy Fraction in Regular Graphs