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

DOI10.5802/alco.169zbMath1473.05299arXiv2008.08503OpenAlexW3198893576MaRDI QIDQ2232305

Mahsa N. Shirazi, Karen Meagher, Shaun M. Fallat

Publication date: 4 October 2021

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

association schemeErdős-Ko-Rado theoremcliqueperfect matchingscharacter tablequotient graphscocliqueratio bound

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Some Erdös-Ko-Rado results for linear and affine groups of degree two ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions

Uses Software

• GAP
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Eigenvalues of the derangement graph
• On the minimal degrees of characters of \(S_n\)
• The perfect matching association scheme
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado
• Erdős-Ko-Rado for perfect matchings
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Erdős-Ko-Rado theorems for uniform set-partition systems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
• Intersecting families of permutations
• Intersecting families of permutations

This page was built for publication: The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings