English

The signless Laplacian spectral Tur\'an problems for hypergraphs

Combinatorics 2026-01-16 v2

Abstract

Let H=(V,E)\mathcal{H}=(V, E) be an rr-uniform hypergraph on nn vertices. The signless Laplacian spectral radius of H\mathcal{H} is defined as the maximum modulus of the eigenvalues of the tensor Q(H)=D(H)+A(H)\mathcal{Q}(\mathcal{H})=\mathcal{D}(\mathcal{H})+\mathcal{A}(\mathcal{H}), where D(H)\mathcal{D}(\mathcal{H}) and A(H)\mathcal{A}(\mathcal{H}) are the degree diagonal tensor and the adjacency tensor of H\mathcal{H}, respectively. In this paper, we establish a general theorem that extends the spectral Tur\'an result of Keevash, Lenz and Mubayi [SIAM J. Discrete Math., 28 (4) (2014)] to the setting of signless Laplacian spectral Tur\'an problems. We prove that if a family F\mathcal{F} of rr-uniform hypergraphs is degree-stable with respect to a family Hn\mathcal{H}_n of rr-uniform hypergraphs and its extremal constructions satisfy certain natural assumptions, then the signless Laplacian spectral Tur\'an problem for F\mathcal{F} can be effectively reduced to the corresponding problem restricted to the family Hn\mathcal{H}_n. As a concrete application, we completely determine the extremal hypergraph that maximizes the signless Laplacian spectral radius among all Fano plane-free 33-uniform hypergraphs, showing that the unique extremal hypergraph is the balanced complete bipartite 33-uniform hypergraph.

Keywords

Cite

@article{arxiv.2601.08595,
  title  = {The signless Laplacian spectral Tur\'an problems for hypergraphs},
  author = {Yongchun Lu and Jiadong Wu and Liying Kang},
  journal= {arXiv preprint arXiv:2601.08595},
  year   = {2026}
}

Comments

23 page

R2 v1 2026-07-01T09:02:49.596Z