Search arXivSearch

arXiv · 2601.08595

The signless Laplacian spectral Turán problems for hypergraphs

Abstract

Let $\mathcal{H}=(V, E)$ be an $r$-uniform hypergraph on $n$ vertices. The signless Laplacian spectral radius of $\mathcal{H}$ is defined as the maximum modulus of the eigenvalues of the tensor $\mathcal{Q}(\mathcal{H})=\mathcal{D}(\mathcal{H})+\mathcal{A}(\mathcal{H})$, where $\mathcal{D}(\mathcal{H})$ and $\mathcal{A}(\mathcal{H})$ are the degree diagonal tensor and the adjacency tensor of $\mathcal{H}$, respectively. In this paper, we establish a general theorem that extends the spectral Turán result of Keevash, Lenz and Mubayi [SIAM J. Discrete Math., 28 (4) (2014)] to the setting of signless Laplacian spectral Turán problems. We prove that if a family $\mathcal{F}$ of $r$-uniform hypergraphs is degree-stable with respect to a family $\mathcal{H}_n$ of $r$-uniform hypergraphs and its extremal constructions satisfy certain natural assumptions, then the signless Laplacian spectral Turán problem for $\mathcal{F}$ can be effectively reduced to the corresponding problem restricted to the family $\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 $3$-uniform hypergraphs, showing that the unique extremal hypergraph is the balanced complete bipartite $3$-uniform hypergraph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongchun Lu, Jiadong Wu, Liying Kang. 2026-01-15. The signless Laplacian spectral Turán problems for hypergraphs. https://arxiv.org/abs/2601.08595

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO