On the spectrum of the perfect matching derangement graph

DOI10.1007/S10801-021-01105-YMaRDI QIDQ2159396zbMATH OpenOpenAlexFDO

Authors Paul Renteln

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

zbMATH Keywords

perfect matchingderangement graphalternating sign conjectureshifted zonal polynomialsErdős-Ko-Rado

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05)

Recommendations

• Perfect matchings and derangements on graphs
• On the spectrum of the derangement graph
• Anti-forcing spectra of perfect matchings of graphs
• Spectral characterization of matchings in graphs
• On the spectrum of the forced matching number of graphs
• Matchings in graphs from the spectral radius
• The \(A_\alpha\)-spectral radius and perfect matchings of graphs
• scientific article; zbMATH DE number 1808637
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Spectral radius and fractional perfect matchings in graphs

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 1160557 (Why is no real title available?)
• scientific article; zbMATH DE number 972692 (Why is no real title available?)
• scientific article; zbMATH DE number 972693 (Why is no real title available?)
• 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
• Eigenvalues of the derangement graph
• Eigenvalues of the matching derangement graph
• Erdős-Ko-Rado for perfect matchings
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdős-Ko-Rado theorems. Algebraic approaches
• On the spectrum of the derangement graph
• Shifted Jack polynomials, binomial formula, and applications
• Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
• Some combinatorial properties of Jack symmetric functions

Cited in

(4)

• Alternating sign property of the perfect matching derangement graph
• The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
• Anti-forcing spectra of perfect matchings of graphs
• An upper bound for the height of a tree with a given eigenvalue

This page was built for publication: On the spectrum of the perfect matching derangement graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159396)