A signless Laplacian spectral Erd\"os-Stone-Simonovits theorem

Abstract

The celebrated Erdos--Stone--Simonovits theorem states that ex(n,F)= (1-1(F)-1+o(1) )n22, where (F) is the chromatic number of F. In 2009, Nikiforov proved a spectral extension of the Erdos--Stone--Simonovits theorem in terms of the adjacency spectral radius. In this paper, we shall establish a unified extension in terms of the signless Laplacian spectral radius. Let q(G) be the signless Laplacian spectral radius of G and we denote exq(n,F) = \q(G):|G|=n ~and~F G\. It is known that the Erdos--Stone--Simonovits type result for the signless Laplacian spectral radius does not hold for even cycles. We prove that if F is a graph with (F)≥ 3, then exq(n,F)=(1-1(F)-1+o(1) )2n. This solves a problem proposed by Li, Liu and Feng (2022), which gives an entirely satisfactory answer to the problem of estimating exq(n,F). Furthermore, it extends the aforementioned result of Erdos, Stone and Simonovits as well as the spectral result of Nikiforov. Our result indicates that the Erdos--Stone--Simonovits type result regarding the signless Laplacian spectral radius is valid in general.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…