Maximum degree and diversity in intersecting hypergraphs

DOI10.1016/j.jctb.2020.01.001zbMath1443.05178OpenAlexW2999294740MaRDI QIDQ777477

Peter Frankl

Publication date: 7 July 2020

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2020.01.001

zbMATH Keywords

inequalitiesfinite setsdiversitymaximum degreefamilies of subsets

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (4)

On the Holroyd-Talbot conjecture for sparse graphs ⋮ Improved bounds on the maximum diversity of intersecting families ⋮ Minimum degree and diversity in intersecting antichains ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unbalance of set systems
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Maximum degree and fractional matchings in uniform hypergraphs
• Two extremal problems on intersecting families
• Diversity of uniform intersecting families
• Regular bipartite graphs and intersecting families
• Erdős-Ko-Rado from Kruskal-Katona
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets

This page was built for publication: Maximum degree and diversity in intersecting hypergraphs