Abstract
We consider the following higher-order analog of the Erdős-Ko-Rado theorem [1]. For positive integers r and n with r ≤ n, let M r r be the family of all matchings of size r in the complete graph K 2n . For any edge e ∈ E(K 2n ), the family M n r(e), which consists of all sets in M r r containing e is called the star centered at e.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
P. Erdös, C. Ko and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math Oxford Ser. (2) 12 (1961), 313–320.
G. O. H. Katona, A simple proof of the Erdős-Ko-Rado theorem, J. Combin. Theory Ser. B 12 (1972), 183–184.
K. Meagher and L. Moura, Erdős-Ko-Rado theorems for uniform set-partition systems, Electronic Journal of Combinatorics 12 (2005), Paper 40, 12 pp.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Kamat, V., Misra, N. (2013). An Erdős-Ko-Rado theorem for matchings in the complete graph. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_98
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_98
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)