Pseudo sunflowers

DOI10.1016/j.ejc.2022.103553zbMath1490.05264OpenAlexW4280628649MaRDI QIDQ2143417

Peter Frankl

Publication date: 31 May 2022

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

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

zbMATH Keywords

\(k\)-uniform familyErdős-Rado sunflower lemma

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (1)

Intersecting families with sunflower shadows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• On the combinatorial problems which I would most like to see solved
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• Inequalities for minimal covering sets in set systems of given rank
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Intersection theorems for systems of sets
• Intersection Theorems for Systems of Sets
• Intersection Properties of Systems of Finite Sets
• Improved bounds for the sunflower lemma
• A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
• On intersecting families of finite sets

This page was built for publication: Pseudo sunflowers