Eigenvalues of the matching derangement graph
From MaRDI portal
Publication:1631395
DOI10.1007/s10801-017-0809-8zbMath1401.05184OpenAlexW2772193348MaRDI QIDQ1631395
Publication date: 6 December 2018
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-017-0809-8
Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
On the spectrum of the perfect matching derangement graph ⋮ The perfect matching association scheme ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ Stability for 1-intersecting families of perfect matchings ⋮ Alternating sign property of the perfect matching derangement graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic decomposition of \(k\)-permutations and eigenvalues of the arrangement graphs
- Largest independent sets of certain regular subgraphs of the derangement graph
- The smallest eigenvalues of the 1-point fixing graph
- Eigenvalues of the derangement graph
- The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph
- Cayley graph on symmetric group generated by elements fixing \(k\) points
- On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
- Erdős-Ko-Rado for perfect matchings
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- Erdős-Ko-Rado theorems for uniform set-partition systems
- 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: Eigenvalues of the matching derangement graph
