Incompatible intersection properties

DOI10.1007/S00493-019-4064-6MaRDI QIDQ2300156zbMATH OpenOpenAlexWikidataFDO

Authors Andrey B. Kupavskii, Peter Frankl

Publication date 26 February 2020

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

intersection properties

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Let $mathcalFsubset{2}^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|mathcalF|le{2}^{n-2}$ is proved. We believe that $38$ can be replaced by $3$ and provide a simple-looking conjecture that would imply this.

Recommendations

• Multiply-intersecting families
• Multiply intersecting families of sets
• Non-trivial 3-wise intersecting uniform families
• 3-wise exactly 1-intersecting families of sets
• Random walks and multiply intersecting families

Cited in

(14)

• Multiply-intersecting families
• Random walks and multiply intersecting families
• 3-wise exactly 1-intersecting families of sets
• Multiply intersecting families of sets
• Weighted 3-wise 2-intersecting families
• Bounds on Borsuk numbers in distance graphs of a special type
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
• Correction to: ``Idealness of \(k\)-wise intersecting families
• On dividing sets into parts of smaller diameter
• Families of finite sets satisfying intersection restrictions
• Pairwise Incompatible Generic Families
• Idealness of k-wise intersecting families
• Triangles in intersecting families
• Triangles in \(r\)-wise \(t\)-intersecting families

This page was built for publication: Incompatible intersection properties

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