Erdős-Ko-Rado for perfect matchings

DOI10.1016/j.ejc.2017.05.005zbMath1369.05173arXiv1409.2057MaRDI QIDQ2400976

Nathan Lindzey

Publication date: 31 August 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

perfect matching of a complete graph; symmetric commutative association scheme

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Uses Software

• GAP