An Erdős--Ko--Rado theorem for matchings in the complete graph

Vikram Kamat, Neeldhara Misra

We consider the following higher-order analog of the Erdős--Ko--Rado theorem. For positive integers r and n with r<= n, let M^r_n be the family of all matchings of size r in the co…