Skip to main content
Article thumbnail
Location of Repository

Spectral extremal problems for hypergraphs

By Peter Keevash, John Lenz and Dhruv Mubayi


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 a generalised α-spectrum defined using the α-norm for any α> 1; the usual spectrum is the case α = 2. Our results imply that any hypergraph Turá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 α-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 α-spectral radius of any graph on n vertices not containing some fixed colour-critical graph, when n is sufficiently large; this generalises a theorem of Nikiforov. We also obtain an α-spectral version of the Erdős-Ko-Rado theorem on t-intersecting k-uniform hypergraphs.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.