Maximizing H‐Colorings of a Regular Graph
From MaRDI portal
Publication:4920651
DOI10.1002/jgt.21658zbMath1262.05052arXiv1110.3758OpenAlexW1910126432MaRDI QIDQ4920651
Publication date: 21 May 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.3758
Related Items (11)
A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs ⋮ On replica symmetry of large deviations in random graphs ⋮ Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ Homomorphisms into loop-threshold graphs ⋮ On the Widom–Rowlinson Occupancy Fraction in Regular Graphs ⋮ 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 ⋮ Extremal colorings and independent sets ⋮ A reverse Sidorenko inequality ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree ⋮ Counting colorings of a regular graph
Cites Work
- A note on the independence number of triangle-free graphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Entropy, independent sets and antichains: A new approach to Dedekind’s problem
- Maximizing the number of q -colorings
- The Bipartite Swapping Trick on Graph Homomorphisms
- The Multistate Hard Core Model on a Regular Tree
- Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
- The Number of Independent Sets in a Regular Graph
- A logical expansion in mathematics
- Markov random field models of multicasting in tree networks
- Extremal graphs for homomorphisms
- Information Inequalities for Joint Distributions, With Interpretations and Applications
This page was built for publication: Maximizing H‐Colorings of a Regular Graph