Some Turán-type results for the signless Laplacian spectral radius
arXiv:2507.02263 · doi:10.1016/j.ejc.2026.104373
Abstract
Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every -vertex graph with edges contains a blowup with . A well-known theorem of Nikiforov [Combin. Probab. Comput. 18 (3) (2009)] asserts that if is an -vertex graph with adjacency spectral radius , then contains a blowup with . This gives a spectral version of the Bollobás--Erdős theorem. In this paper, we systematically explore variants of Nikiforov's result in terms of the signless Laplacian spectral radius, extending the supersaturation, blowup of cliques and the stability results.
31 pages. Any suggestions are welcome
References in corpus (8)
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- Counting substructures and eigenvalues I: triangles
- Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
- A spectral Erdős-Faudree-Rousseau theorem
- Spectral supersaturation: Triangles and bowties
- A spectral Erdős-Rademacher theorem
- Linear spectral Turan problems for expansions of graphs with given chromatic number
- Spectral bipartite Turan problems on linear hypergraphs