An A_-spectral Erdős-Pósa theorem
From MaRDI portal
Publication:6098083
Recommendations
- A Spectral Erdős-Sós Theorem
- A spectral Erdős-Stone-Bollobás theorem
- A quantitative Erdös–Fuchs theorem and its generalization
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- A continuous analogue of Erdős' \(k\)-Sperner theorem
- scientific article; zbMATH DE number 3900758
- A generalization of the Erdős-Ko-Rado theorem
- A generalization of the Erdős-Ko-Rado theorem
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Erdős-Ko-Rado theorems. Algebraic approaches
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3215864 (Why is no real title available?)
- A contribution to the Zarankiewicz problem
- Bounds on graph eigenvalues. II
- Extremal graphs for two vertex-disjoint copies of a clique
- Merging the \(A\)- and \(Q\)-spectral theories
- On Independent Complete Subgraphs in a Graph
- On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
- On an extremal problem in graph theory.
- On maximal paths and circuits of graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the Turán number of forests
- On the A_-spectral radius of graphs without large matchings
- On the \(A_{\alpha}\)-spectra of trees
- On the spectral radius of graphs without a star forest
- Problems in algebraic combinatorics
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Some new results in extremal graph theory
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- Spectral extrema of graphs: forbidden hexagon
- Spectral extremal results with forbidding linear forests
- Spectral radius of graphs with given matching number
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The Turán number of disjoint copies of paths
- The Turán number of star forests
- The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
- The history of degenerate (bipartite) extremal graph problems
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- The spectral radius of graphs without paths and cycles of specified length
- Turán number for \(pS_r\)
- Turán numbers for disjoint copies of graphs
- Turán numbers of multiple paths and equibipartite forests
Cited in
(4)
This page was built for publication: An \(A_\alpha\)-spectral Erdős-Pósa theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098083)