On the number of independent sets in uniform, regular, linear hypergraphs

  title={On the number of independent sets in uniform, regular, linear hypergraphs},
  author={Emma Cohen and Will Perkins and Michail Sarantis and Prasad Tetali},
  journal={Eur. J. Comb.},

Figures from this paper


Counting independent sets in regular hypergraphs
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
The latter result is applied to show that the Shannon capacity of the n-dimensional $(d,\infty)$-runlength-limited (RLL) constraint converges to 1/(d+1) as n goes to infinity.
Independent sets, matchings, and occupancy fractions
The method involves constrained optimization problems over distributions of random variables and applies to all d-regular graphs directly, without a reduction to the bipartite case, and proves the asymptotic upper matching conjecture of Friedland, Krop, Lundow, and Markstrom.
Counting independent sets in cubic graphs of given girth
Extremes of the internal energy of the Potts model on cubic graphs
Taking the zero-temperature limit gives new results in extremal combinatorics: the number of $q-colorings of a $3-regular graph, for any $q \ge 2$, is maximized by a union of $K_{3,3}$'s, which proves the d=3 case of a conjecture of Galvin and Tetali.
On the Number of Independent Sets in Simple Hypergraphs
Extremal problems on the number of j-independent sets in uniform simple hypergraphs are studied. Nearly optimal results on the maximum number of independent sets for the class of simple regular
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
This survey concerns regular graphs that are extremal with respect to the number of independent sets and graph homomorphisms, and reviews existing techniques, highlights some exciting recent developments, and discusses open problems and conjectures.
On the Widom–Rowlinson Occupancy Fraction in Regular Graphs
A tight upper bound is proved on the occupancy fraction, the expected fraction of vertices occupied by a particle under a random configuration from the Widom–Rowlinson model, which is achieved uniquely by unions of complete graphs on d + 1 vertices, K d+1.
On the average size of independent sets in triangle-free graphs
We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly
Counting Independent Sets in Hypergraphs
The lower bounds follow from a more general statement, which applies to hereditary properties of hypergraphs, and generalizes a result of Duke, Lefmann and Rödl, which guarantees the existence of an independent set of sizemega.