An improved universal bound for t-intersecting families

DOI10.1016/J.EJC.2020.103134zbMATH Open1439.05216OpenAlexW3016089132MaRDI QIDQ2178676FDOQ2178676

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

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

zbMATH Keywords

intersection theoremssystems of finite sets

Mathematics Subject Classification ID

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

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems with geometric consequences
• The complete intersection theorem for systems of finite sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection theorems for systems of finite sets
• A new short proof of the EKR theorem
• On hypergraphs without two edges intersecting in a given number of vertices
• On t-designs

Cited In (2)

• On strengthenings of the intersecting shadow theorem
• 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)