An improved universal bound for \(t\)-intersecting families

DOI10.1016/j.ejc.2020.103134zbMath1439.05216OpenAlexW3016089132MaRDI QIDQ2178676

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)

Related Items (1)

On strengthenings of the intersecting shadow theorem

Cites Work

• Unnamed Item
• Unnamed Item
• A new short proof of the EKR theorem
• The complete intersection theorem for systems of finite sets
• On hypergraphs without two edges intersecting in a given number of vertices
• Intersection theorems with geometric consequences
• On t-designs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets

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