An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings

DOI10.1016/j.disc.2023.113444zbMath1515.05180arXiv2110.02175OpenAlexW4366403216WikidataQ122279918 ScholiaQ122279918MaRDI QIDQ6041562

Mahsa N. Shirazi

Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

association schemeErdős-Ko-Rado theoremperfect matchingsquotient 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)

Cites Work

• Unnamed Item
• The exact bound in the Erdős-Ko-Rado theorem
• Setwise intersecting families of permutations
• Erdős-Ko-Rado theorems for permutations and set partitions
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• The Erdős-Ko-Rado theorem for vector spaces
• An extension of the Erdoes, Ko, Rado theorem to t-designs
• On the minimal degrees of characters of \(S_n\)
• The perfect matching association scheme
• The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
• Erdős-Ko-Rado for perfect matchings
• 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

This page was built for publication: An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings