The Number of Independent Sets in a Regular Graph
From MaRDI portal
Publication:3557538
DOI10.1017/S0963548309990538zbMath1215.05140arXiv0909.3354OpenAlexW3104688290MaRDI QIDQ3557538
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.3354
Related Items (53)
Counting dominating sets and related structures in graphs ⋮ On the number of connected sets in bounded degree graphs ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Counting maximal antichains and independent sets ⋮ Interview with Yufei Zhao ⋮ On the number of independent sets in simple hypergraphs ⋮ 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 ⋮ 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 ⋮ Minimizing the number of independent sets in triangle-free regular graphs ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ 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 independent set sequence of regular bipartite graphs ⋮ Unnamed Item ⋮ 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 ⋮ Counting independent sets in regular hypergraphs ⋮ On Independent Sets in Graphs with Given Minimum Degree ⋮ Hypergraph containers ⋮ Hypergraph Independent Sets ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ 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 ⋮ Unnamed Item ⋮ Covers, orientations and factors ⋮ A reverse Sidorenko inequality ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree ⋮ Independence polynomials of bipartite graphs ⋮ Counting colorings of a regular graph ⋮ Counting independent sets in graphs ⋮ Counting cliques in 1-planar graphs
Cites Work
- Matchings and independent sets of a fixed size in regular graphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Percolation and the hard-core lattice gas model
- Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities
- Entropy, independent sets and antichains: A new approach to Dedekind’s problem
- THE CAMERON–ERDOS CONJECTURE
This page was built for publication: The Number of Independent Sets in a Regular Graph
