Erdős–Ko–Rado theorems for chordal graphs and trees

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Péter L. Erdős, Chao Ko, R. Rado · The Quarterly Journal of Mathematics · 1961 · 1.3K citations

Theory Of Computing, Combinatorics On Word, Engineering +10

Erdös–Ko–Rado Theorem—22 Years Later

Michel Deza, Péter Frankl · SIAM Journal on Algebraic and Discrete Methods · 1983 · 150 citations

Geometry Of Number, Engineering, Graph Theory +10

INTERSECTING FAMILIES OF SEPARATED SETS

John Talbot · Journal of the London Mathematical Society · 2003 · 53 citations

Weighted K-separated Sets, Graph Theory, Set A ⊆ +8

An analogue of the Erdös-Ko-Rado theorem for the Hamming schemes H(n, q)

Aeryung Moon · Journal of Combinatorial Theory Series A · 1982 · 49 citations

Hamming Schemes H, Combinatorial Design, Erdös-ko-rado Theorem +3

An ordered version of the Erdös-Ko-Rado theorem

Marilynn Livingston · Journal of Combinatorial Theory Series A · 1979 · 30 citations

Order Theory, Combinatorial Design, Ordered Version +2