On regular 3-wise intersecting families

DOI10.1090/PROC/14153MaRDI QIDQ3177823zbMATHOpenAlexWikidataFDO

Authors Keith Frankston, Bhargav P. Narayanan, J. Kahn

Publication date 2 August 2018

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Frankl's conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05) Group actions on combinatorial structures (05E18)

Abstract: Ellis and the third author showed, verifying a conjecture of Frankl, that any $3$-wise intersecting family of subsets of $1,2,dots,n$ admitting a transitive automorphism group has cardinality $o(2^n)$, while a construction of Frankl demonstrates that the same conclusion need not hold under the weaker constraint of being regular. Answering a question of Cameron, Frankl and Kantor from 1989, we show that the restriction of admitting a transitive automorphism group may be relaxed significantly: we prove that any $3$-wise intersecting family of subsets of $1,2,dots,n$ that is regular and increasing has cardinality $o(2^n)$.

Recommendations

• On symmetric 3-wise intersecting families
• Intersecting families of finite sets and fixed-point-free 2-elements
• Non-trivial 3-wise intersecting uniform families
• 3-wise exactly 1-intersecting families of sets
• Regular intersecting families

Cites work

• scientific article; zbMATH DE number 3503316 (Why is no real title available?)
• scientific article; zbMATH DE number 3586931 (Why is no real title available?)
• A survey of Turán problems for expansions
• An approximate zero-one law
• Boolean functions with low average sensitivity depend on few coordinates
• Erdös–Ko–Rado Theorem—22 Years Later
• Every monotone graph property has a sharp threshold
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting families of finite sets and fixed-point-free 2-elements
• On Russo's approximate zero-one law
• On symmetric 3-wise intersecting families
• Regular intersecting families
• Regularity Conditions and Intersecting Hypergraphs
• The complete intersection theorem for systems of finite sets

Cited in

(7)

• Intersecting families of finite sets and fixed-point-free 2-elements
• On symmetric intersecting families of vectors
• Families of finite sets with three intersections
• Regular intersecting families
• The maximum measure of 3-wise \(t\)-intersecting families
• On symmetric 3-wise intersecting families
• Non-trivial 3-wise intersecting uniform families

This page was built for publication: On regular 3-wise intersecting families

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