Erdös–Ko–Rado Theorem—22 Years Later
- 1 December 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 4 (4) , 419-431
- https://doi.org/10.1137/0604042
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- On set intersectionsJournal of Combinatorial Theory, Series A, 1980
- Some Properties of Perfect Matroid DesignsAnnals of Discrete Mathematics, 1980
- Intersection Properties of Systems of Finite SetsProceedings of the London Mathematical Society, 1978
- On the maximum number of permutations with given maximal or minimal distanceJournal of Combinatorial Theory, Series A, 1977
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPHThe Quarterly Journal of Mathematics, 1976
- Erdös-Ko-Rado from Kruskal-KatonaJournal of Combinatorial Theory, Series A, 1974
- Solution d'un problème de Erdös-LovászJournal of Combinatorial Theory, Series B, 1974
- Intersecting families of edges in hypergraphs having the hereditary propertyPublished by Springer Nature ,1974
- A generalization of a combinatorial theorem of macaulayJournal of Combinatorial Theory, 1969
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961