On the spectrum of the perfect matching derangement graph
From MaRDI portal
Publication:2159396
DOI10.1007/s10801-021-01105-yzbMath1493.05285OpenAlexW4205537601MaRDI QIDQ2159396
Publication date: 29 July 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-021-01105-y
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Eigenvalues of the derangement graph
- On the spectrum of the derangement graph
- Shifted Jack polynomials, binomial formula, and applications
- Eigenvalues of the matching derangement graph
- Some combinatorial properties of Jack symmetric functions
- Erdős-Ko-Rado for perfect matchings
- 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
- Distributions of Matrix Variates and Latent Roots Derived from Normal Samples
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the spectrum of the perfect matching derangement graph