The Number of Independent Sets in a Regular Graph
From MaRDI portal
Publication:3557538
DOI10.1017/S0963548309990538zbMath1215.05140arXiv0909.3354MaRDI 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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms, On the average size of independent sets in triangle-free graphs, Hypergraph Independent Sets, Maximizing H‐Colorings of a Regular Graph, Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree, Unnamed Item, A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems, Interview with Yufei Zhao, Extremal H‐Colorings of Graphs with Fixed Minimum Degree, On the Widom–Rowlinson Occupancy Fraction in Regular Graphs, On Independent Sets in Graphs with Given Minimum Degree, Extremal Graphs for Homomorphisms II, Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree, Tight bounds on the coefficients of partition functions via stability, Unnamed Item, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, Counting dominating sets and related structures in graphs, The independent set sequence of regular bipartite graphs, Hypergraph containers, Independent sets in 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, Two problems on independent sets in graphs, The number of independent sets in a graph with small maximum degree, Counting MSTD sets in finite abelian groups, Covers, orientations and factors, A reverse Sidorenko inequality, On the number of connected sets in bounded degree graphs, On the number of independent sets in simple hypergraphs, Minimizing the number of independent sets in triangle-free regular graphs, Counting independent sets in cubic graphs of given girth, A proof of the upper matching conjecture for large graphs, Counting sum-free sets in abelian groups, Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs, Independence polynomials of bipartite graphs, Counting cliques in 1-planar graphs, Homomorphisms into loop-threshold graphs, Independent sets in the middle two layers of Boolean lattice, Counting independent sets in regular hypergraphs, On the number of independent sets in uniform, regular, linear hypergraphs, The number of independent sets in an irregular graph, Counting colorings of a regular graph, Counting independent sets in graphs, Counting maximal antichains and independent sets, The maximum number of complete subgraphs in a graph with given maximum degree, Maximum number of fixed points in AND-OR-NOT networks, Maximizing the number of independent sets in claw-free cubic graphs, Birthday inequalities, repulsion, and hard spheres, On the Number of Connected Sets in Bounded Degree Graphs, Counting independent sets in triangle-free graphs, On replica symmetry of large deviations in random graphs, A New Method for Enumerating Independent Sets of a Fixed Size in General 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
