Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\'an problems

TL;DR

This paper extends the Alon--Frankl Theorem to hypergraphs, determining maximum edges avoiding certain matchings and clique expansions, and introduces the rainbow hyper-Turán number for clique expansions.

Contribution

It provides new bounds for hypergraph Turán problems involving matchings and clique expansions, confirming parts of a recent conjecture and linking hyper-Turán and rainbow hyper-Turán problems.

Findings

Determined maximum edges in hypergraphs avoiding specific matchings and clique expansions.

Established the rainbow hyper-Turán number for expansions of cliques.

Extended classical Turán results to hypergraph and rainbow settings.

Abstract

Given a graph $F$, the $r$-expansion $F^{(r)+}$ of $F$ is the $r$-uniform hypergraph obtained from $F$ by inserting $r-2$ new distinct vertices in each edge of $F$. Recently, Alon and Frankl (JCTB, 2024) and Gerbner (JGT, 2023) studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. Gerbner, Tompkins and Zhou (EJC, 2025) considered the analogous Tur\'{a}n problems on hypergraphs with bounded matching number. In this paper, we study hypergraph extensions of the Alon--Frankl Theorem. More precisely, we determine the maximum number of hyperedges in an $n$-vertex $r$-uniform hypergraph containing neither a matching $M^r_{s+1}$ nor the expansion $K_{\ell+1}^{(r)+}$ of the clique $K_{\ell+1}$ for all small $s<\frac{\ell^2-1}{2}$ and all sufficiently large $s$, respectively. This result partly confirms a conjecture proposed by Gerbner, Tompkins and Zhou (EJC, 2025). As a key tool, we determine the rainbow hyper-Tur\'{a}n number for expansions of cliques, which is defined as the maximum sum of size of a sequence of hypergraphs $\mathcal{H}_1,\dots,\mathcal{H}_k$ that contains no rainbow copies of expansions of cliques with given size. It extends the result of Keevash, Saks, Sudakov and Verstra{\"e}te (AAM, 2004), which determined the rainbow Tur\'an number of cliques in the graph case. These results shows a correlation between the hyper-Tur\'an problem and the rainbow hyper-Tur\'an number.