×

A generalization of the Erdős-Ko-Rado theorem on finite set systems. (English) Zbl 0269.05003


MSC:

05A05 Permutations, words, matrices
05A20 Combinatorial inequalities
03E05 Other combinatorial set theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Erdös, P.; Ko, C.; Rado, R., Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser., 12, 313-320 (1961) · Zbl 0100.01902
[2] Kleitman, D. J., Families of nondisjoint subsets, J. Combinatorial Theory, 1, 153-155 (1966) · Zbl 0141.00801
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.