Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
From MaRDI portal
Publication:2444728
DOI10.1016/j.ejc.2013.01.008zbMath1285.05116arXiv1207.3878WikidataQ122930061 ScholiaQ122930061MaRDI QIDQ2444728
Publication date: 11 April 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3878
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Largest independent sets of certain regular subgraphs of the derangement graph, The smallest eigenvalues of the 1-point fixing graph, Eigenvalues of the matching 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
Cites Work
- Unnamed Item
- Eigenvalues of the derangement graph
- On the spectrum of the derangement graph
- Spectra of Cayley graphs
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Shift operators and factorial symmetric functions
- Shifted Jack polynomials, binomial formula, and applications
- The factorial Schur function
- Generating a random permutation with random transpositions
- Intersecting families of permutations