An Erd\H{o}s--Ko--Rado theorem for matchings in the complete graph

zbMath1291.05159arXiv1303.4061MaRDI QIDQ5420031

Neeldhara Misra, Vikram Kamat

Publication date: 11 June 2014

Full work available at URL: https://arxiv.org/abs/1303.4061

zbMATH Keywords

starsKatona's cycle method

Mathematics Subject Classification ID

Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities

This page was built for publication: An Erd\H{o}s--Ko--Rado theorem for matchings in the complete graph