Spread approximations for forbidden intersections problems

DOI10.1016/J.AIM.2024.109653MaRDI QIDQ6493709zbMATH OpenWikidataFDO

Authors Andrey B. Kupavskii, D. D. Zakharov

Publication date 29 April 2024

Published in Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

intersecting familyextremal set theoryErdős-Ko-Radospread approximation

Mathematics Subject Classification ID

Extremal set theory (05D05) Graph theory (05Cxx) Enumerative combinatorics (05Axx)

Recommendations

• Approximation by juntas in the symmetric group, and forbidden intersection problems
• Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
• Frankl-Rödl-type theorems for codes and permutations
• On $t$-Intersecting Families of Permutations
• Forbidding just one intersection, for permutations

Cites work

• Are many small sets explicitly small?
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Forbidden Intersections
• Intersecting families of permutations
• Intersection theorems with geometric consequences
• Note on sunflowers
• On symmetric intersecting families
• On the maximum number of permutations with given maximal or minimal distance
• The complete intersection theorem for systems of finite sets
• Threshold functions

Cited in

(2)

• A smoother notion of spread hypergraphs
• Improved covering results for conjugacy classes of symmetric groups via hypercontractivity

This page was built for publication: Spread approximations for forbidden intersections problems

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