Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs

DOI10.1016/j.ejc.2016.04.005zbMath1339.05268arXiv1505.08044OpenAlexW1897016437MaRDI QIDQ298341

Karen Gunderson, Béla Bollobás, Paul N. Balister

Publication date: 20 June 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsindependence densities

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cites Work

• Independence densities of hypergraphs
• Independence and chromatic densities of graphs
• Hypergraph containers
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• Extremal uncrowded hypergraphs
• On uncrowded hypergraphs
• Hypergraph Independent Sets
• Independent sets in hypergraphs
• On independent sets in hypergraphs
• Counting Independent Sets in Hypergraphs