Skip to content
Preprint

Rational Tur\'an exponents of a single $k$-uniform hypergraph

Nov 2026 · 0 citations · 16 references
Mathematics

Abstract

For a fixed $k$-uniform hypergraph $F$, let $\mathrm{ex}_k(n,F)$ denote the maximum number of edges in an $F$-free $k$-uniform hypergraph on $n$ vertices. We prove that for every integer $k\ge2$ and every rational $r\in[0,1]$ there exists a $k$-uniform hypergraph $F_{k,r}$ such that \begin{equation*} \mathrm{ex}_k(n,F_{k,r})=\Theta(n^{k-r}). \end{equation*} The case $k=2$ is the rational exponents conjecture of Erd\H{o}s and Simonovits \cite{Erdos1988}, also known as Erd\H{o}s problem \#571 \cite{BloomErdoswebsite}; a proof was announced in September 2026 and is expounded by Conlon et al.\ \cite{Conlon-Janzer-Jiang-Kim-Lee-Liu-Longbrake-Yepremyan}. For $k\ge3$ the theorem extends their result to $k$-uniform hypergraphs. In the single-hypergraph setting, this strengthens Fitch's finite-family theorem \cite{Fitch} by realizing each exponent with a single forbidden $k$-uniform hypergraph for $0\le r\le1$. We also show, via an explicit two-edge construction, that for $k\ge4$ this strengthening fails for $\lceil k/2\rceil<r\le k-1$: no single $k$-uniform hypergraph $F$ then satisfies $\mathrm{ex}_k(n,F)=\Theta(n^{k-r})$. The main result of this paper has been formalized in Lean 4, conditional on two explicitly stated axioms.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.