An improved universal bound for t-intersecting families

DOI10.1016/J.EJC.2020.103134MaRDI QIDQ2178676zbMATH OpenOpenAlexFDO

Authors Peter Frankl

Publication date 11 May 2020

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

Full work available at URL https://doi.org/10.1016/j.ejc.2020.103134

zbMATH Keywords

intersection theoremssystems of finite sets

Mathematics Subject Classification ID

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

Recommendations

• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
• On cross t-intersecting families of sets
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• Uniform Intersecting Families with Covering Number Restrictions

Cites work

• A new short proof of the EKR theorem
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• Intersection theorems with geometric consequences
• On hypergraphs without two edges intersecting in a given number of vertices
• On t-designs
• The complete intersection theorem for systems of finite sets

Cited in

(4)

• On strengthenings of the intersecting shadow theorem
• Application of hypergraph Hoffman's bound to intersecting families
• A universal bound concerning \(t\)-intersecting families
• Short proofs of three results about intersecting systems

This page was built for publication: An improved universal bound for \(t\)-intersecting families

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