A general 2-part Erd os-Ko-Rado theorem
Abstract
A two-part extension of the famous Erdos-Ko-Rado Theorem is proved. The underlying set is partitioned into X1 and X2. Some positive integers ki, i (1≤ i≤ m) are given. We prove that if F is an intersecting family containing members F such that |F X1|=ki, |F X2|=i holds for one of the values i (1≤ i≤ m) then | F| cannot exceed the size of the largest subfamily containing one element.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.