The Erdős-Ko-Rado theorem for 22-intersecting families of perfect matchings

preprint2020arXivOpen access

Abstract

A perfect matching in the complete graph on 2k2k 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 tt-intersecting if they have at least tt 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 kk. Specifically, for k≥3k\geq 3 a set of 2-intersecting perfect matchings in K2kK_{2k} of maximum size has (2k−5)(2k−7)⋯(1)(2k-5)(2k-7)\cdots (1) perfect matchings.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.