Spectral extremal problems for hypergraphs

TL;DR

This paper develops spectral extremal results for hypergraphs using the lpha-spectral radius, linking stability properties of classical extremal problems to their spectral counterparts, with applications to Ture1n problems and intersecting hypergraphs.

Contribution

It introduces general criteria connecting stability-based extremal hypergraph results to their spectral versions for any lpha>1, extending known theorems to a broader spectral context.

Findings

Determined maximum lpha-spectral radius for hypergraphs avoiding the Fano plane.

Extended spectral Ture1n results to lpha-spectral radius for graphs avoiding color-critical subgraphs.

Proved an lpha-spectral version of the Erdf6s-Ko-Rado theorem.

Abstract

In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria under which such results may be deduced from `strong stability' forms of the corresponding (pure) extremal results. These results hold for the \alpha-spectral radius defined using the \alpha-norm for any \alpha>1; the usual spectrum is the case \alpha=2. Our results imply that any hypergraph Tur\'{a}n problem which has the stability property and whose extremal construction satisfies some rather mild continuity assumptions admits a corresponding spectral result. A particular example is to determine the maximum \alpha-spectral radius of any 3-uniform hypergraph on n vertices not containing the Fano plane, when n is sufficiently large. Another is to determine the maximum \alpha-spectral radius of any graph on n vertices not containing some fixed colour-critical graph, when n is sufficiently large; this generalizes a theorem of Nikiforov who proved stronger results in the case \alpha=2. We also obtain an \alpha-spectral version of the Erd\H{o}s-Ko-Rado theorem on t-intersecting k-uniform hypergraphs.