Best possible bounds on the number of distinct differences in intersecting families

DOI10.1016/j.ejc.2022.103601zbMath1498.05266arXiv2106.05355OpenAlexW3165925946MaRDI QIDQ2080226

Andrey B. Kupavskii, Sergei Kiselev, Peter Frankl

Publication date: 7 October 2022

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

Full work available at URL: https://arxiv.org/abs/2106.05355

zbMATH Keywords

intersecting familyfinite setssetwise difference

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Extremal set theory (05D05)

Related Items

The Erdős matching conjecture and concentration inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new short proof for the Kruskal-Katona theorem
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Regular bipartite graphs and intersecting families
• On the number of distinct differences in an intersecting family
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Differences of Sets and A Problem of Graham