Improved bounds concerning the maximum degree of intersecting hypergraphs

DOI10.37236/11616MaRDI QIDQ6574372zbMATH OpenFDO

Authors Peter Frankl, Jian Wang

Publication date 18 July 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/11616

zbMATH Keywords

\(t\)-intersecting \(k\)-graphErdős-Ko-Rado theorem

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Beyond the Erdős-Ko-Rado theorem
• Maximum degree and diversity in intersecting hypergraphs
• Maximum size intersecting families of bounded minimum positive co-degree
• On t-Intersecting Hypergraphs with Minimum Positive Codegrees

Cites work

• A product version of the Hilton-Milner-Frankl theorem
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3489128 (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?)
• Intersecting Families are Essentially Contained in Juntas
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• Intersections and distinct intersections in cross-intersecting families
• On r-cross intersecting families of sets
• On intersecting families of finite sets
• On strengthenings of the intersecting shadow theorem
• On the maximum of the sum of the sizes of non-trivial cross-intersecting families
• Simple juntas for shifted families
• THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
• The exact bound in the Erdős-Ko-Rado theorem
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The size of a hypergraph and its matching number

This page was built for publication: Improved bounds concerning the maximum degree of intersecting hypergraphs

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