Alternating sign property of the perfect matching derangement graph
From MaRDI portal
Publication:2102701
Permutations, words, matrices (05A05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05) Association schemes, strongly regular graphs (05E30) Eigenvalues, singular values, and eigenvectors (15A18)
Recommendations
Cites work
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
- Cayley graph on symmetric group generated by elements fixing k points
- Cyclic decomposition of k-permutations and eigenvalues of the arrangement graphs
- 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
- Harmonic analysis on finite groups. Representation theory, Gelfand pairs and Markov chains
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- Intersecting families of permutations
- Largest independent sets of certain regular subgraphs of the derangement graph
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- On the partition associated to the smallest eigenvalues of the k-point fixing graph
- On the spectrum of the derangement graph
- On the spectrum of the perfect matching derangement graph
- Shifted symmetric functions and multirectangular coordinates of Young diagrams
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- Some combinatorial properties of Jack symmetric functions
- The smallest eigenvalues of the 1-point fixing graph
- The spectrum of eigenvalues for certain subgraphs of the k-point fixing graph
Cited in
(6)- Eigenvalues of the matching derangement graph
- Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph
- Pairing theorem of graph eigenvalues: its new proof and a generalization
- Counting deranged matchings
- The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
- Robustness of Erdős-Ko-Rado theorems on permutations and perfect matchings
This page was built for publication: Alternating sign property 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 Q2102701)