Eigenvalues of the derangement graph
From MaRDI portal
Publication:965212
DOI10.1016/j.jcta.2009.10.002zbMath1209.05145arXiv0803.2901OpenAlexW2016760742MaRDI QIDQ965212
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.2901
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Eigenvalues of the matching derangement graph ⋮ Eigenvalues of Cayley graphs ⋮ On the spectrum of the perfect matching derangement graph ⋮ Erdős-Ko-Rado for perfect matchings ⋮ The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph ⋮ The smallest eigenvalues of the 1-point fixing graph ⋮ Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph ⋮ The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings ⋮ Cayley graph on symmetric group generated by elements fixing \(k\) points ⋮ Largest independent sets of certain regular subgraphs of the derangement graph ⋮ Alternating sign property of the perfect matching derangement graph ⋮ On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersecting families in the alternating group and direct product of symmetric groups
- An Erdős-Ko-Rado-type theorem in Coxeter groups.
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- On the spectrum of the derangement graph
- On the maximum number of permutations with given maximal or minimal distance
- The representation theory of the symmetric groups
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Stable sets of maximal size in Kneser-type graphs
- Intersecting families of permutations
