Erdős-Ko-Rado for perfect matchings

DOI10.1016/j.ejc.2017.05.005zbMath1369.05173arXiv1409.2057OpenAlexW2730819323MaRDI 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 graphsymmetric commutative association scheme

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Eigenvalues of the matching derangement graph, 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, The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings, Stability for 1-intersecting families of perfect matchings, Alternating sign property of the perfect matching derangement graph

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicity-free permutation representations of the symmetric group.
• Eigenvalues of the derangement graph
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• On the spectrum of the derangement graph
• Brick decompositions and the matching rank of graphs
• On the maximum number of permutations with given maximal or minimal distance
• Four questions on Birkhoff polytopes
• Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
• Erdős-Ko-Rado theorems for uniform set-partition systems
• TWO THEOREMS IN GRAPH THEORY
• The Matching Polytope has Exponential Extension Complexity
• Paths, Trees, and Flowers
• Structural Information and Communication Complexity
• On Symmetrized Kronecker Powers and the Structure of the Free Lie Ring
• Intersecting families of permutations