An Entropy Approach to the Hard-Core Model on Bipartite Graphs
From MaRDI portal
Publication:2731583
DOI10.1017/S0963548301004631zbMath0985.60088OpenAlexW1986646471MaRDI QIDQ2731583
Publication date: 9 May 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301004631
Applications of graph theory (05C90) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (75)
On the number of sum-free triplets of sets ⋮ Counting dominating sets and related structures in graphs ⋮ On the maximum number of Latin transversals ⋮ On the number of connected sets in bounded degree graphs ⋮ Tree densities in sparse graph classes ⋮ Counting maximal antichains and independent sets ⋮ The number of k‐SAT functions ⋮ Interview with Yufei Zhao ⋮ On the number of independent sets in simple hypergraphs ⋮ Independent sets in quasi-regular graphs ⋮ Rigidity of 3-colorings of the discrete torus ⋮ A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs ⋮ Counting independent sets in triangle-free graphs ⋮ On replica symmetry of large deviations in random graphs ⋮ Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ Trees with given stability number and minimum number of stable sets ⋮ On the Number of Connected Sets in Bounded Degree Graphs ⋮ Homomorphisms into loop-threshold graphs ⋮ On the average size of independent sets in triangle-free graphs ⋮ Entropy-variance inequalities for discrete log-concave random variables via degree of freedom ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Minimizing the number of independent sets in triangle-free regular graphs ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ Entropy bounds for perfect matchings and Hamiltonian cycles ⋮ \(H\)-colouring bipartite graphs ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ Maximizing the Number of Independent Sets of a Fixed Size ⋮ New mathematical techniques in information theory. Abstracts from the workshop held March 13--19, 2022 ⋮ On the Widom–Rowlinson Occupancy Fraction in Regular Graphs ⋮ The maximum number of complete subgraphs in a graph with given maximum degree ⋮ Maximizing the number of independent sets in claw-free cubic graphs ⋮ Two problems on independent sets in graphs ⋮ The homomorphism domination exponent ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Independent sets in the middle two layers of Boolean lattice ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ The number of independent sets in a graph with small maximum degree ⋮ Independent sets in the hypercube revisited ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ Counting independent sets in regular hypergraphs ⋮ Hypergraph containers ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ Independent sets in graphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ Notes on use of generalized entropies in counting ⋮ On the number of \(r\)-matchings in a tree ⋮ The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph ⋮ Graphs with the fewest matchings ⋮ Entropy, independent sets and antichains: A new approach to Dedekind’s problem ⋮ Maximizing H‐Colorings of a Regular Graph ⋮ Extremal Graphs for Homomorphisms II ⋮ Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree ⋮ Counting MSTD sets in finite abelian groups ⋮ Counting sum-free sets in abelian groups ⋮ \(H\)-coloring tori ⋮ Range of cube-indexed random walk ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Extremal graphs for homomorphisms ⋮ Birthday inequalities, repulsion, and hard spheres ⋮ Counting independent sets in cubic graphs of given girth ⋮ Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree ⋮ The number of independent sets in an irregular graph ⋮ Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs ⋮ Majorization and Rényi entropy inequalities via Sperner theory ⋮ Matchings and independent sets of a fixed size in regular graphs ⋮ An upper bound for the number of independent sets in regular graphs ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Covers, orientations and factors ⋮ A reverse Sidorenko inequality ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree ⋮ Counting colorings of a regular graph ⋮ Counting independent sets in graphs ⋮ Counting cliques in 1-planar graphs
This page was built for publication: An Entropy Approach to the Hard-Core Model on Bipartite Graphs
