An \(A_\alpha\)-spectral Erdős-Pósa theorem
From MaRDI portal
Publication:6098083
DOI10.1016/j.disc.2023.113494zbMath1516.05107OpenAlexW4376289040WikidataQ122231508 ScholiaQ122231508MaRDI QIDQ6098083
Shuchao Li, Huihui Zhang, Yuantian Yu
Publication date: 12 June 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113494
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Turán number of forests
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- On the \(A_{\alpha}\)-spectra of trees
- Turán numbers for disjoint copies of graphs
- On an extremal problem in graph theory.
- Spectral extrema of graphs: forbidden hexagon
- A contribution to the Zarankiewicz problem
- Spectral radius of graphs with given matching number
- The spectral radius of graphs without paths and cycles of specified length
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- Spectral bounds for the clique and independence numbers of graphs
- Problems in algebraic combinatorics
- Spectral extremal results with forbidding linear forests
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The Turán number of star forests
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- On the \(A_\alpha\)-spectral radius of graphs without large matchings
- Extremal graphs for two vertex-disjoint copies of a clique
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- The Turán number of disjoint copies of paths
- Spectral extrema for graphs: the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- On the spectral radius of graphs without a star forest
- Some new results in extremal graph theory
- Turán Numbers of Multiple Paths and Equibipartite Forests
- On maximal paths and circuits of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- Merging the A-and Q-spectral theories
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Independent Complete Subgraphs in a Graph
- On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
This page was built for publication: An \(A_\alpha\)-spectral Erdős-Pósa theorem