A unified combinatorial view beyond some spectral properties

DOI10.1007/S10801-024-01353-8MaRDI QIDQ6635841zbMATH OpenFDO

Authors Xiaofeng Gu, Muhuo Liu

Publication date 12 November 2024

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10801-024-01353-8

zbMATH Keywords

eigenvalueexpander mixing lemmafractional matchingHamilton cyclematchingtoughness

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• Toughness in pseudo-random graphs
• Graph toughness from Laplacian eigenvalues
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Spectral conditions for connectivity, toughness and perfect k-matchings of regular graphs
• Toughness and spectral radius in graphs

Cites work

• A proof of Brouwer's toughness conjecture
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• An inequality using perfect matchings and Laplacian spread of a graph
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• Dense expanders and pseudo-random bipartite graphs
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Eigenvalue bounds for independent sets
• Eigenvalues and perfect matchings
• Explicit construction of linear sized tolerant networks
• Fractional matching number and eigenvalues of a graph
• Graph toughness from Laplacian eigenvalues
• Graphs and matching theorems
• scientific article; zbMATH DE number 997668 (Why is no real title available?)
• scientific article; zbMATH DE number 2133152 (Why is no real title available?)
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• scientific article; zbMATH DE number 3668627 (Why is no real title available?)
• scientific article; zbMATH DE number 3211575 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Laplacian spectral bounds for clique and independence numbers of graphs
• Large matchings from eigenvalues
• Matchings in regular graphs from eigenvalues
• On a class of posets and the corresponding comparability graphs
• On representatives of subsets.
• Perfect matchings, eigenvalues and expansion
• Pseudo-random graphs
• Sparse pseudo‐random graphs are Hamiltonian
• The Factorization of Linear Graphs
• The spectrum and toughness of regular graphs
• The toughness of Kneser graphs
• Tight bounds for powers of Hamilton cycles in tournaments
• Tough graphs and Hamiltonian circuits.
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Toughness and the existence of \(k\)-factors. III
• Toughness and triangle-free graphs
• Toughness in graphs -- a survey
• Toughness in pseudo-random graphs

Cited in

(3)

• A unified framework for the expander mixing lemma for irregular graphs and its applications
• Generalized toughness and spectral radius of graphs
• Two variants of toughness of a graph and its eigenvalues

This page was built for publication: A unified combinatorial view beyond some spectral properties

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