Spectral Tur'an problems for complete bipartite expansions in linear hypergraphs

arXiv:2610.34065 · math.CO · Submitted 2026-10-25 · Read on arXiv

math.CO

Submitted: 2026-10-25

Updated: 2026-10-25

License: http://creativecommons.org/licenses/by/4.0/

The gist: An r-uniform hypergraph is linear if any two edges share at most one vertex.

Terminology

Abstract

An r-uniform hypergraph is linear if any two edges share at most one vertex. For a family F of r-graphs, let ex lin r(n, F) and spex lin r(n, F) denote, respectively, the maximum number of edges and the maximum spectral radius of an n-vertex F-free linear r-graph. In this paper, we show that for t at least s at least3, spex lin r(n,K s,t+) at most(t-s+1) 1/s over r-1n 1-1/s+o(n 1-1/s), where K s,t+ is the r-graph obtained from the complete bipartite graph K s,t by enlarging each edge with r-2 new vertices. This answers a problem of She, Fan and Kang in a stronger form. Moreover, our result implies that ex lin r(n,K s,t+) at most(t-s+1) 1/s over r(r-1)n 2-1/s+o(n 2-1/s), which improves the leading coefficient in the corresponding bound of Gao and Chang. We also give a construction which implies that spex lin r(n,K s,t+)=Θ(n 1-1/s) and ex lin r(n,K s,t+)=Θ(n 2-1/s) for s at least 4r-6 and t>(s-1)!.

Related papers