On Counting Independent Sets in Regular Hypergraphs

Source abstract

Balogh, Bollobás and Narayanan conjectured that among all finite simple $r$-uniform $d$-regular hypergraphs, the number of weak independent sets is maximized by a natural quasi-bipartite construction $H_{r,d}$. We give three types of evidence for this conjecture. For every fixed $r$, we prove the conjectured asymptotic exponential rate whenever the twin quotient has maximum pair codegree $o(d)$. The proof uses the hypergraph container method. For hypergraphs with no cross-edges, the occupancy method gives the sharper error bound $O_r(\log d/d)$. We show that a stronger version of the conjecture in terms of the so-called occupancy fraction is not true, by providing a counterexample for every $r\ge 3$. We also prove exact cases of the conjecture when the hypergraph is $2$-regular. Using an entropy decomposition in the dual edge-cover problem, we settle every odd $r$ and the case $(r,d)=(4,2)$.