Counting independent sets in regular hypergraphs

DOI10.1016/j.jcta.2021.105405zbMath1459.05229arXiv2002.09995OpenAlexW3120739701MaRDI QIDQ2229168

József Balogh, Béla Bollobás, Bhargav P. Narayanan

Publication date: 22 February 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.09995

zbMATH Keywords

entropyhypergraphsindependent sets

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Coloring the normalized Laplacian for oriented hypergraphs ⋮ On the number of independent sets in uniform, regular, linear hypergraphs

Cites Work

• A reverse Sidorenko inequality
• Some intersection theorems for ordered sets and graphs
• Independent sets in regular graphs and sum-free subsets of finite groups
• On the number of independent sets in uniform, regular, linear hypergraphs
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
• Independent sets, matchings, and occupancy fractions

This page was built for publication: Counting independent sets in regular hypergraphs