Table of Contents
Fetching ...

Some Turán-type results for the signless Laplacian spectral radius

Jian Zheng, Yongtao Li, Yi-Zheng Fan

Abstract

Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every $n$-vertex graph $G$ with $e(G)\ge (1- \frac{1}{k} + \varepsilon )\frac{n^2}{2}$ edges contains a blowup $K_{k+1}[t]$ with $t=Ω_{k,\varepsilon}(\log 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)\ge (1- \frac{1}{k} + \varepsilon)n$, then $G$ contains a blowup $K_{k+1}[t]$ with $t=Ω_{k,\varepsilon}(\log n)$. 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.

Some Turán-type results for the signless Laplacian spectral radius

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.

Paper Structure

This paper contains 28 sections, 36 theorems, 96 equations, 1 table, 2 algorithms.

Key Result

Theorem 1.1

If $F$ is a graph with chromatic number $\chi (F)=k+1 \ge 2$, then

Theorems & Definitions (57)

  • Theorem 1.1: See ES1946ES1966
  • Theorem 1.2: See Gui1996ESB2009
  • Theorem 1.3: See ZLS2025
  • Theorem 2.1: Bollobás--Nikiforov BN2007jctb
  • Theorem 2.2
  • Theorem 2.3: Nikiforov ESB2009
  • Theorem 2.4
  • Theorem 2.5: Nikiforov N2009
  • Theorem 2.6
  • Theorem 2.7: Li--Liu--Zhang LLZ2024-book-4-cycle
  • ...and 47 more