The Exact Erdos-Ko-Rado Theorem for 3-wise t-intersecting uniform families
Abstract
Let F be a family of k-element subsets of \1,2,…,n\. For t≥ 1, we say that F is 3-wise t-intersecting if |F1 F2 F3|≥ t for all F1,F2,F3∈ F. In the present paper, we prove that if F is 3-wise t-intersecting and n≥ 4t+9-12k, k>t≥ 46, then |F|≤ n-tk-t. The restriction on n is asymptotically best possible. The corresponding result for non-trivial 3-wise t-intersecting families is obtained as well for n≥ 4t+9-12k and k>t≥ 55.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.