Maximum degree and diversity in intersecting hypergraphs

DOI10.1016/J.JCTB.2020.01.001MaRDI QIDQ777477zbMATH OpenOpenAlexFDO

Authors 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

diversityfamilies of subsetsfinite setsinequalitiesmaximum degree

Mathematics Subject Classification ID

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

Recommendations

• On the maximum number of distinct intersections in an intersecting family
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Diversity of uniform intersecting families
• On the union of intersecting families
• Intersecting k-uniform families containing all the k-subsets of a given set

Cites work

• Diversity of uniform intersecting families
• Erdős-Ko-Rado from Kruskal-Katona
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximum degree and fractional matchings in uniform hypergraphs
• On intersecting families of finite sets
• Regular bipartite graphs and intersecting families
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The unbalance of set systems
• Two extremal problems on intersecting families

Cited in

(21)

• Finite projective spaces and intersecting hypergraphs
• Minimum degree and diversity in intersecting antichains
• Shattered matchings in intersecting hypergraphs
• Maximum size intersecting families of bounded minimum positive co-degree
• A note on Huang-Zhao theorem on intersecting families with large minimum degree
• On diversity of certain \(t\)-intersecting families
• Diversities and the Geometry of Hypergraphs
• Diversity
• On the Holroyd-Talbot conjecture for sparse graphs
• Improved bounds on the maximum diversity of intersecting families
• Improved bounds concerning the maximum degree of intersecting hypergraphs
• A generalization of diversity for intersecting families
• Size, diversity, minimum degree, sturdiness, dömdödöm
• Maximal non-empty cross s-union families
• Two results on set families: sturdiness and intersection
• Intersecting families with covering number 3
• On the C-diversity of intersecting k-graphs
• A result for hemi-bundled cross-intersecting families
• Best possible bounds on the double-diversity of intersecting hypergraphs
• On the maximum diversity of hypergraphs with fixed matching number
• A note on the maximum diversity of intersecting families in the symmetric group

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777477)