The Exact Erdős–Ko–Rado Theorem for 3-Wise 𝑡-Intersecting Uniform Families
Studia Scientiarum Mathematicarum Hungarica · 11.11.2026 · 63 (3) · 267-295
DOI: 10.1556/012.2026.04360 ↗Kurz gefasst
Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, erschienen am 11.11.2026. Verfasst von Peter Frankl und 1 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben.
Abstract (Originalsprache)
One of the central problems in extremal set theory is the determination of the maximum size of an 𝑟-wise 𝑡-intersecting 𝑘-graph on 𝑛 vertices. For 𝑟 = 2 after decades of effort, a complete solution was given by the Complete Intersection Theorem ([2]). However the case 𝑟 ≥ 3 remains wide open. The 𝑡-star consisting of all 𝑘-sets containing a fixed 𝑡-set provides a lower bound. For 𝑟 = 3 and 𝑘 ≥ 𝑡 + 2 ≥ 44, we determine the exact threshold for which it is optimal for 𝑛 > 𝑘. The condition is essentially 𝑛 ≥ √𝑡𝑘. For 𝑘 ≥ 𝑡 + 2 ≥ 47 and 𝑛 ≥ √4𝑡+9−1 2 𝑘, we also establish the corresponding Hilton–Milner-type stability result.
Zitieren
APA
Frankl, P., & Wang, J. (2026). The Exact Erdős–Ko–Rado Theorem for 3-Wise 𝑡-Intersecting Uniform Families. Studia Scientiarum Mathematicarum Hungarica, 63(3), 267-295. https://doi.org/10.1556/012.2026.04360
Vancouver
Frankl P, Wang J. The Exact Erdős–Ko–Rado Theorem for 3-Wise 𝑡-Intersecting Uniform Families. Studia Scientiarum Mathematicarum Hungarica. 2026;63(3):267-295. doi:10.1556/012.2026.04360
BibTeX
@article{Frankl2026,
author = {Frankl, Peter and Wang, Jian},
title = {The Exact Erdős–Ko–Rado Theorem for 3-Wise 𝑡-Intersecting Uniform Families},
journal = {Studia Scientiarum Mathematicarum Hungarica},
year = {2026},
volume = {63},
number = {3},
pages = {267--295},
doi = {10.1556/012.2026.04360}
}
EUVIMED