Some Tur\'an-type results for the signless Laplacian spectral radius
Abstract
Half a century ago, Bollob\'as and Erdos [Bull. London Math. Soc. 5 (1973)] proved that every n-vertex graph G with e(G) (1- 1k + )n22 edges contains a blowup Kk+1[t] with t=k,( n). A well-known theorem of Nikiforov [Combin. Probab. Comput. 18 (3) (2009)] asserts that if G is an n-vertex graph with adjacency spectral radius λ (G) (1- 1k + )n, then G contains a blowup Kk+1[t] with t=k,( n). This gives a spectral version of the Bollob\'as--Erdos 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.