4 citations · 5 across the 13 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
On k-wise intersecting families of vertex sets in perfect matchings
Vikram Kamat
We consider the following generalization of the seminal Erdős-Ko-Rado theorem, due to Frankl. For k>= 2, let F be a k-wise intersecting family of r-subsets of an n element set X, i…
math.CO2013
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…