Abstract
A family of sets is said to be symmetric if its automorphism group is transitive, and 3-wise intersecting if any three sets in the family have nonempty intersection. Frankl conjectured in 1981 that if A is a symmetric 3-wise intersecting family of subsets of {1, 2, …, n}, then |A| = o(2n). Here, we give a short proof of Frankl’s conjecture using a ‘sharp threshold’ result of Friedgut and Kalai.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2843-2847 |
| Number of pages | 5 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 145 |
| Issue number | 7 |
| DOIs | |
| State | Published - 2017 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'On symmetric 3-wise intersecting families'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver