# On the Number of Independent Sets in Uniform, Regular, Linear Hypergraphs

Cohen Emma
Sarantis Michail
Cited by: 0|Views12

Abstract:

We study the problems of bounding the number weak and strong independent sets in \$r\$-uniform, \$d\$-regular, \$n\$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up to the first order term for all (fixed) \$r\ge 3\$, with \$d\$ and \$n\$ going to infinity. In the case o...More

Code:

Data:

Full Text
Bibtex