Abstract
A perfect matching in the complete graph on vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be -intersecting if they have at least edges in common. The main result in this paper is an extension of the famous Erdős-Ko-Rado (EKR) theorem \cite{EKR} to 2-intersecting families of perfect matchings for all values of . Specifically, for a set of 2-intersecting perfect matchings in of maximum size has perfect matchings.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.