An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings

DOI10.26493/1855-3974.976.c47zbMath1370.05102arXiv1506.08770OpenAlexW2962686173MaRDI QIDQ5357299

Karen Meagher, Chris D. Godsil

Publication date: 14 September 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08770

zbMATH Keywords

Erdős-Ko-Rado theoremindependent setsperfect matching derangement graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (15)

Eigenvalues of the matching derangement graph ⋮ Some Erdös-Ko-Rado results for linear and affine groups of degree two ⋮ On the spectrum of the perfect matching derangement graph ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ The perfect matching association scheme ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ On triangles in derangement graphs ⋮ The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings ⋮ The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations ⋮ Stability for 1-intersecting families of perfect matchings ⋮ All 2-transitive groups have the EKR-module property ⋮ 3-setwise intersecting families of the symmetric group ⋮ Alternating sign property of the perfect matching derangement graph

This page was built for publication: An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings