Answers are grounded in this paper and cite their sources.
Derives bounds on the size of intersecting k-graphs, suggesting implications for combinatorial structures.
Let n > 2k ≥ 4 n > 2 k ≥ 4 and let F ⊂ [n] k F ⊂ [ n ] k be an intersecting k k -graph on n n vertices, that is, F∩ F' ≠ ∅ F ∩ F ′ ≠ ∅ for all F, F' ∈ F F , F ′ ∈ F . By the Erd{o}s--Ko--Rado Theorem | F| ≤ n - 1 k - 1 | F | ≤ n - 1 k - 1 with equality holding only for the full-star, Sₓ S x , the family of all k k -sets containing the vertex x x . If we exclude stars, that is, subfamilies of Sₓ S x then | F| ≤ n - 1 k - 1 - n - k - 1 k - 1 + 1 | F | ≤ n - 1 k - 1 - n - k - 1 k - 1
No takes yet. Share an insight, caveat, or question.
P. Frankl (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: