A spectral Erdős-Stone-Bollobás theorem

DOI10.1017/S0963548309009687MaRDI QIDQ3557501zbMATH OpenOpenAlexFDO

Authors Vladimir Nikiforov

Publication date 23 April 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.2259

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Abstract: We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.

Recommendations

• Stability for large forbidden subgraphs
• An extension of the Erdős-Stone theorem
• Graphs with many r -cliques have large complete r -partite subgraphs
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
• Spectral saturation: inverting the spectral Turán theorem

Cites work

• Cliques and the spectral radius
• Graphs with many r -cliques have large complete r -partite subgraphs
• On the Structure of Edge Graphs
• On the structure of linear graphs

Cited in

(23)

• Some exact results for generalized Turán problems
• Spectral theory of extended Harper's model and a question by Erdős and Szekeres
• A spectral Erdős-Rademacher theorem
• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• An \(A_\alpha\)-spectral Erdős-Pósa theorem
• Stability for large forbidden subgraphs
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
• On the spectral moment of graphs with given clique number
• Sharp bounds for the signless Laplacian spectral radius in terms of clique number
• Spectral saturation: inverting the spectral Turán theorem
• Extremal Halin graphs with respect to the signless Laplacian spectra
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Three conjectures in extremal spectral graph theory
• On the signless Laplacian spectra of \(k\)-trees
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• A unique characterization of spectral extrema for friendship graphs
• On the spectral radius of graphs with given maximum degree and girth
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Some new results in extremal graph theory
• Spectral extremal results with forbidding linear forests

This page was built for publication: A spectral Erdős-Stone-Bollobás theorem

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