Perfect matchings, eigenvalues and expansion
From MaRDI portal
(Redirected from Publication:5481401)
Recommendations
Cited in
(44)- Matchings in regular graphs from eigenvalues
- Spectral radius and \(k\)-connectedness of a graph
- Eigenvalues and perfect matchings
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Distance spectrum, 1-factor and vertex-disjoint cycles
- Spectral radius and \([a,b]\)-factors in graphs
- The perfect matching association scheme
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- Invariant random perfect matchings in Cayley graphs
- Graph toughness from Laplacian eigenvalues
- Regular factors and eigenvalues of regular graphs
- An inequality using perfect matchings and Laplacian spread of a graph
- Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
- Cospectral regular graphs with and without a perfect matching
- Matching and Laplacian eigenvalues
- Fractional matching number and eigenvalues of a graph
- An extremal problem on Q-spectral radii of graphs with given size and matching number
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spectral radius and fractional perfect matchings in graphs
- Cluster expansion formulas and perfect matchings
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- Binding number, \(k\)-factor and spectral radius of graphs
- Perfect matchings as IID factors on non-amenable groups
- Fractional matchings in graphs from the spectral radius
- Constructing the mate of cospectral 5-regular graphs with and without a perfect matching
- Spectral techniques in graph theory: an introduction to adjacency matrix eigenvalues
- Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
- A unified combinatorial view beyond some spectral properties
- Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs
- Spectral radius and rainbow k-factors of graphs
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- Spectral radius, the matching number and fractional criticality of graphs
- Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
- Spectral extremal problems on factors in tough graphs, and beyond
- Clique factors in pseudorandom graphs
- Fractional perfect matching and distance spectral radius in graphs
- Characterizations of fractional factor-critical graphs via size and spectral radius
- A note on the spectral radius and \([a,b]\)-factor of graphs
- Eigenvalues and factors: a survey
- Minimal spectral radius of graphs with given matching number
- Tight spectral and size conditions for (fractional) (a, b; k)-critical graphs
- Signless Laplacian spectral radius and fractional matchings in graphs
- Large matchings from eigenvalues
This page was built for publication: Perfect matchings, eigenvalues and expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481401)
