Signless Laplacian Spectral Turán Problem

• The paper establishes the asymptotic bounds for the signless Laplacian spectral Turán function by linking graph structure with forbidden subgraphs.
• It employs Rayleigh quotient, vertex deletion, and stability techniques to analyze extremal graphs like balanced complete multipartite graphs and split graphs.
• The study extends classical results to hypergraphs and simplicial complexes, highlighting open challenges in the bipartite and multidimensional settings.

The Signless Laplacian Spectral Turán Problem seeks, for a given forbidden subgraph $F$ and integer $n$, the explicit determination or sharp asymptotics of

$$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$

where $q(G)$ is the largest eigenvalue (the Q-index, or signless Laplacian spectral radius) of $Q(G) = D(G) + A(G)$, with $D(G)$ the degree matrix and $A(G)$ the adjacency matrix. This problem generalizes classical Turán extremal graph theory into a spectral context and reveals structural and spectral analogues for graph families, cycles, color-critical graphs, and more, with further extensions to hypergraphs and simplicial complexes.

1. Formulation and Basic Definitions

Let $G$ be a simple $n$-vertex graph. The signless Laplacian is defined as

$Q(G) = D(G) + A(G),$

where $n$0 is the diagonal matrix of vertex degrees and $n$1 the adjacency matrix. The spectral radius—maximum eigenvalue of $n$2—is denoted $n$3. For a forbidden subgraph $n$4, the signless Laplacian spectral Turán function is

$n$5

The central question is to determine asymptotic or exact values for $n$6 and identify all extremal graphs attaining this maximum.

2. General Theorems and Chromatic Threshold

The analogue of the Erdős–Stone–Simonovits theorem—i.e., the spectral Turán theorem—has been developed for $n$7. For any $n$8 with chromatic number $n$9,

$$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$0

and the limit

$$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$1

holds. The extremal examples are balanced complete $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$2-partite graphs $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$3. This result extends both the classical extremal formula for the number of edges and Nikiforov’s spectral version for the adjacency matrix. Precise asymptotics and an explicit $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$4-term (but not a named constant) are given for the error, and the case of bipartite $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$5 (e.g., even cycles) is excluded due to known counterexamples (Zheng et al., 16 Feb 2025).

Class of $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$6	Asymptotic $$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$7	Extremal Structure
$$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$8	$$\mathrm{ex}_q(n,F) := \max\{ q(G) : |V(G)| = n,\ F \not\subseteq G \},$$9	Balanced complete $q(G)$0-partite graph
$q(G)$1	Not of above form; exceptions for bipartite $q(G)$2	Problem open

3. Special Families and Exact Results

Research has provided exact and asymptotic answers for various forbidden subgraphs:

• Complete graphs and colors: Forbidding $q(G)$3 or any color-critical $q(G)$4 with $q(G)$5, the unique extremal graph maximizing $q(G)$6 is $q(G)$7, and $q(G)$8 (Zheng et al., 10 Apr 2025, Wu et al., 1 Dec 2025).
• Odd and even cycles: For $q(G)$9 or $Q(G) = D(G) + A(G)$0-free graphs, the extremal graph is $Q(G) = D(G) + A(G)$1 (a $Q(G) = D(G) + A(G)$2-clique joined to an independent set). For $Q(G) = D(G) + A(G)$3, this structure optimizes $Q(G) = D(G) + A(G)$4 for large $Q(G) = D(G) + A(G)$5 but does not conform to the Turán-type density formula, highlighting a key deviation for bipartite $Q(G) = D(G) + A(G)$6 (Chen et al., 2021).
• Fans and intersecting triangles: For the $Q(G) = D(G) + A(G)$7-fan (the graph $Q(G) = D(G) + A(G)$8), the unique extremal is again $Q(G) = D(G) + A(G)$9 for $D(G)$0, with

$D(G)$1

(Zhao et al., 2020).

• Linear forests and theta graphs: For certain linear forests (forests with at most two odd paths) and forbidden theta graphs $D(G)$2, the extremal graphs are split graphs $D(G)$3, $D(G)$4, their slight modifications, or friendship graphs depending on forbidden pattern (Liu et al., 2024, Chen et al., 2020).
• Trees and the Erdős–Sós context: Forbidding all trees of order $D(G)$5 (or $D(G)$6), the extremal graph is $D(G)$7 ($D(G)$8) or its variant $D(G)$9, the latter adding an edge within the independent set, generalizing spectral analogues of classical tree extremal theory (Chen et al., 2022).

Forbidden Structure	Extremal Graph	Exact $A(G)$0/Formula
$A(G)$1-free, $A(G)$2	$A(G)$3	$A(G)$4
$A(G)$5-free or $A(G)$6-free	$A(G)$7	Closed form in $A(G)$8
Tree of order $A(G)$9 forbidden	$G$0	$G$1
Trees of order $G$2 forbidden	$G$3	Real root of associated cubic
$G$4-minor free (large $G$5)	$G$6	Polynomial for $G$7

4. Proof Techniques and Methodology

Most proofs employ a combination of:

• Rayleigh quotient maximization and explicit Perron vector construction/analysis.
• Vertex deletion and eigenvector minimality (removing the smallest coordinate to perform induction or contradiction).
• Degree threshold/stability reduction: Forbidding $G$8 or imposing a high $G$9 forces "almost" $n$0-partite or split structure through degree sum/Cauchy interlacing arguments.
• Structure theorems from extremal combinatorics (e.g., complete bipartite subgraphs must contain all large trees).
• Equitable partition and quotient matrix reductions for computation of Q-index.
• Monotonicity and local perturbation arguments: Any deviation from the extremal construction decreases $n$1.
• Spectral stability theorems: If $n$2 is near the extremal value, $n$3 is close in edit distance to an extremal configuration (Zheng et al., 10 Apr 2025, Chen et al., 2021, Zheng et al., 16 Feb 2025, Zheng et al., 3 Jul 2025).

5. Extensions: Hypergraphs and Simplicial Complexes

Recent advances extend the signless Laplacian spectral Turán problem to:

• $n$4-uniform hypergraphs: Formulated with $n$5-order tensors $n$6, where spectral extremality is obtained through reduction to “degree-stable” families. For example, for the Fano plane, the extremal $n$7-graph is the balanced bipartite $n$8-graph $n$9, with $Q(G) = D(G) + A(G),$0 exactly computed (Lu et al., 13 Jan 2026).
• Simplicial complexes: The signless Laplacian is extended as $Q(G) = D(G) + A(G),$1 for the $Q(G) = D(G) + A(G),$2-th up Laplacian on $Q(G) = D(G) + A(G),$3-faces of a complex $Q(G) = D(G) + A(G),$4. The extremal spectral radius, for pure $Q(G) = D(G) + A(G),$5-dimensional, $Q(G) = D(G) + A(G),$6-hole-free complexes, is attained by the tented complex $Q(G) = D(G) + A(G),$7, with

$Q(G) = D(G) + A(G),$8

yielding bounds for both hypergraph and simplicial complex Turán numbers (Fan et al., 30 Jul 2025).

6. Open Problems and Current Directions

Key open questions and conjectures include:

• Sharp $Q(G) = D(G) + A(G),$9 asymptotics and stability for ex$n$00 beyond color-critical, non-bipartite cases.
• Bipartite forbidden subgraphs (e.g., even cycles $n$01, $n$02): The classical Turán density formula fails; extremal value and structure remain open except for some cases such as $n$03.
• Higher-dimensional and operator generalizations: For p-Laplacians, other normalized variants, and further combinatorial structures.
• Comparison and exact coincidence with edge-Turán extremals: Conjectures propose spectral and classical extremals always coincide for $n$04 with $n$05 for large $n$06.
• Hypergraph and complex stability: Extension of “degree-stable” and spectral removal lemmas.

7. Survey and Synthesis

A synthesis of the known results demonstrates a dichotomy:

• For color-critical, non-bipartite $n$07, the spectral Turán problem behaves identically to its classical extremal analogue, with Turán graphs as unique extremals.
• For bipartite $n$08, linear forests, trees, and theta-graphs, the extremal structures become split graphs, stars, or other special constructions.

Research continues toward:

• Sharper understanding for bipartite $n$09,
• Extensions to hypergraphs and complexes,
• Stability and uniqueness of spectral extremals,
• Identification of signless Laplacian extremals for complex or non-Zykov-symmetric forbidden families.

The field leverages deep interplay between combinatorial extremality, stability methods, and spectral theory, pushing the boundary of extremal and spectral combinatorics (Li et al., 2021, Zheng et al., 16 Feb 2025, Zheng et al., 10 Apr 2025, Fan et al., 30 Jul 2025, Lu et al., 13 Jan 2026).