A Spectral Erdős–Stone–Bollobás Theorem
From MaRDI portal
Publication:3557501
DOI10.1017/S0963548309009687zbMath1208.05077arXiv0707.2259OpenAlexW2029468668MaRDI QIDQ3557501
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
Full work available at URL: https://arxiv.org/abs/0707.2259
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Cites Work
Related Items (18)
Spectral extremal graphs for intersecting cliques ⋮ On the spectral moment of graphs with given clique number ⋮ Some exact results for generalized Turán problems ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ Three conjectures in extremal spectral graph theory ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ Sharp bounds for the signless Laplacian spectral radius in terms of clique number ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ Spectral extremal results with forbidding linear forests ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ On the Laplacian spectral radius of bipartite graphs with fixed order and size ⋮ On the spectral radius of graphs with given maximum degree and girth ⋮ A spectral Erdős-Rademacher theorem ⋮ The maximum spectral radius of \(C_4\)-free graphs of given order and size
This page was built for publication: A Spectral Erdős–Stone–Bollobás Theorem
