A spectral Erdos-Stone-Bollobas theorem
Vladimir Nikiforov
TL;DR
This paper establishes a spectral bound on graphs that provides a quantitative version of the Erdos-Stone theorem, linking spectral graph theory with extremal combinatorics.
Contribution
It introduces a spectral version of the Erdos-Stone-Bollobas theorem, offering new bounds based on spectral radius.
Findings
Spectral radius bounds imply Turán-type extremal results.
Quantitative relationships between spectral properties and graph density.
Enhanced understanding of graph structure via spectral methods.
Abstract
We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Topological and Geometric Data Analysis