Elementary Techniques for Erdos-Ko-Rado-like Theorems

Simple item page
dc.creatorBrockman, Greg
dc.creatorKay, Bill
dc.date2008-08-06
dc.date2008-08-08
dc.date.accessioned2026-07-07T09:55:18Z
dc.date.available2026-07-07T09:55:18Z
dc.descriptionThe well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also provides necessary and sufficient conditions for attaining the maximum. We present elementary methods for deriving generalizations of the Erdos-Ko-Rado Theorem on several classes of combinatorial objects. We also extend our results to systems under Hamming intersection.
dc.description10 pages, 0 figures
dc.identifierhttps://arxiv.org/abs/0808.0774
dc.identifierhttp://arxiv.org/abs/0808.0774
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166583
dc.subjectCombinatorics
dc.subject05D05
dc.titleElementary Techniques for Erdos-Ko-Rado-like Theorems
dc.typetext

Files

Collections

arXiv