A general framework for discovering and proving theorems of the Erdős- Ko-Rado type

DOI10.1016/0097-3165(92)90022-MzbMath0771.05095OpenAlexW2044521195MaRDI QIDQ1200000

James H. Schmerl

Publication date: 17 January 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90022-m

zbMATH Keywords

Erdős-Ko-Rado theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Extremal set theory (05D05)

Cites Work

• Non-trivial intersecting families
• Finite projective spaces and intersecting hypergraphs
• On the kernel of intersecting families
• Intersection theorems for systems of finite vector spaces
• A note on kernels of intersecting families
• A simple proof of the Erdős-Chao Ko-Rado theorem
• A generalization of the Erdős-Ko-Rado theorem on finite set systems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• SIMULTANEOUSLY DISJOINT PAIRS OF SUBSETS OF A FINITE SET
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets

This page was built for publication: A general framework for discovering and proving theorems of the Erdős- Ko-Rado type