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

Shaun Fallat, Karen Meagher, Mahsa N. Shirazi

A perfect matching in the complete graph on $2k$ 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 mat…