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

  • Kamat V
  • Misra N
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Kamat, V., & Misra, N. (2013). An Erdős-Ko-Rado theorem for matchings in the complete graph. In The Seventh European Conference on Combinatorics, Graph Theory and Applications (pp. 613–613). Scuola Normale Superiore. https://doi.org/10.1007/978-88-7642-475-5_98

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free