Turán Numbers for Hypergraph Traces

• Turán Numbers for Traces are quantitative measures in r-uniform hypergraphs that determine the maximum edge count while avoiding specific induced configurations.
• Advanced combinatorial techniques, including covering designs and codegree methods, yield both asymptotic and precise bounds for forbidden graphs such as stars, cycles, and trees.
• Recent research bridges classical Turán theory with induced Berge-F subgraph analysis, opening new avenues to resolve longstanding extremal problems in hypergraph theory.

Turán numbers for traces quantify the extremal edge counts in $r$-uniform hypergraphs that exclude a specified forbidden configuration as a trace—meaning the configuration appears in an induced manner within a trace of the hypergraph. This concept lies at the intersection of classical Turán-type extremal theory, set-system coverings, and trace-induced hypergraph substructures. Trace-Turán numbers simultaneously generalize the classical graph Turán number $ex(n,F)$ and the induced subgraph enumeration in hypergraph traces, providing nuanced control over forbidden configurations in high-dimensional discrete structures. Recent developments, particularly those by Füredi, Luo, Mubayi, Sali, Spiro, and collaborators, have established both precise bounds and foundational equivalences for several classes of forbidden graphs, including stars, complete graphs, cycles, and trees (Qian et al., 2022, Furedi et al., 2020).

1. Definitions, Terminology, and Trace-Induced Substructures

An $r$-uniform hypergraph $\mathcal{H}$ on an $n$-element vertex set $V(\mathcal{H})$ consists of edges that are all $r$-element subsets. For any subset $S\subseteq V(\mathcal{H})$, the trace of $\mathcal{H}$ on $S$ is given by

$$\mathcal{H}|_S := \{E\cap S : E\in E(\mathcal{H})\},$$

creating a (non-uniform) hypergraph whose edges are intersections of $\mathcal{H}$'s edges with $S$. For an ordinary graph $F$ with vertices $v_1,\ldots,v_p$ and edges $e_1,\ldots,e_q$, $\mathcal{H}$ contains $F$ as a trace if there is a subset $W = \{w_1, \ldots, w_p\} \subseteq V(\mathcal{H})$ (in bijection with $V(F)$) and distinct hyperedges $f_1,\ldots,f_q \in E(\mathcal{H})$ such that for each $e_j = \{v_\alpha, v_\beta\}$, $f_j \cap W = \{w_\alpha, w_\beta\}$. The trace-Turán number is defined as

$ex_r(n,Tr(F))$

which is the maximum number of edges in an $n$-vertex $r$-uniform hypergraph $\mathcal{H}$ that does not contain $F$ as a trace (Qian et al., 2022).

A highly related notion is the induced Berge-$F$ subgraph, where $F$ is represented in the hypergraph via an injective mapping of its edges to hyperedges so that each mapped hyperedge maintains the exact pair of vertices from $F$ and no extra vertices from the mapped subset. This equivalence between trace containment and induced Berge-$F$ allows the direct application of generalized Turán-type extremal results (Furedi et al., 2020).

2. Main Theoretical Results and Bounds

The trace-Turán function $ex_r(n,Tr(F))$ generalizes both $ex(n,F)$ and counts of subgraphs in traces, bridging hypergraph extremal theory with classical Turán numbers. A central result is that, asymptotically, for fixed forbidden $F$,

$$ex_r(n,Tr(F)) = \Theta\left( \max_{2\le s<r}ex(n,K_s,F) \right),$$

where $ex(n,K_s,F)$ denotes the maximum number of $K_s$ subgraphs in an $F$-free graph (Furedi et al., 2020). Lower and upper bounds are given via:

• Lower: $$ex_r(n,Tr(F)) \ge \max_{2\le s<r} ex(n-(r-s), K_s, F)$$
• Upper: $$ex_r(n,Tr(F)) \le r!\sum_{i=2}^r (t-2)^{r-i}(r)_{r-i} ex(n,K_i,F)$$

For specific forbidden graphs $F$, tighter or even exact results exist. When $F$ is a star $K_{1,t}$, the lower bound is sharpened using minimal covering designs:

$$ex_r(n, Tr(K_{1,t})) \ge a \left( \binom{r+t-1}{r} - c \right) + \binom{b}{r},$$

where $n = a(r+t-1) + b$ with $0 \leq b < r+t-1$, and $c$ is the size of any minimal $(r-1)-(r+t-1, r, 1)$ covering (Qian et al., 2022). These covering designs are closely linked to block designs and combinatorial coverings. Exact cases occur for $r=3$ with $n$ divisible by $t+2$, with distinctions depending on congruences modulo $6$; Steiner systems provide sharp bounds.

When $F$ is $K_{2,t}$ and $r=3$, the upper bound is improved for small $t$:

$$ex_3(n, Tr(K_{2,t})) \le \left( \frac{\sqrt{3(3t-1)}\,(t-1)}{3} + \frac{\sqrt{t-1}}{2} \right) n^{3/2} + o(n^{3/2}),$$

improving previous asymptotics for larger $t$ and matching leading terms from known extremal constructions (Qian et al., 2022).

3. Combinatorial Techniques and Covering Constructions

Lower bounds for star-traces exploit covering designs. The hypergraph's vertex set is partitioned into disjoint cliques, and within each, blocks of a minimal covering are deleted, preventing realization of a star trace. Covering parameters and design-theoretic results provide the covering size $c$, and hence, the lower bound (Qian et al., 2022).

Upper bounds for $K_{2,t}$-traces in $3$-uniform hypergraphs use refined codegree-based decomposition:

• Edges containing a pair with codegree $1$ are counted separately ($A$), leveraged by projection onto $ex(n,K_{2,t})$.
• Edges in $B$ (pairs with codegree $\geq 2$) are analyzed via degree sums and double-count techniques, ensuring avoidance of $K_{2,t}$ traces. This approach yields quadratic bounds in average degree $d=O(n^{1/2})$, so the total is $O(n^{3/2})$, with constants computable from greedy lemmas (Qian et al., 2022).

Monotonicity properties and $a$-core decompositions structure inductive arguments to lift bounds across $r$ (Furedi et al., 2020). The $a$-core decomposition partitions a hypergraph so that $(r-1)$-sets in one part satisfy min-degree conditions, allowing direct translation to $ex(n,K_r,F)$ bounds.

4. Special Cases and Explicit Evaluations

Explicit evaluations for special forbidden graphs $F$ include:

• Stars $K_{1,t}$:
  • $ex_3(n,Tr(K_{1,t})) = (n/6)(t^2-2)$ for $t+2\equiv 0 \pmod{6},\, t+2|n$.
  • $ex_3(n,Tr(K_{1,t})) = (n/6)(t^2-1)$ for $t+2\equiv 1,3 \pmod{6},\, t+2|n$.
  • $ex_{2k}(n,Tr(K_{1,3})) = n(k+1)/2$ for $2k(k+1)|n$ (Qian et al., 2022).
• Complete graphs $K_t$:
  • $ex_r(n,Tr(K_t)) = \Theta(n^{r-1})$ for $r < t$, and $0$ for $r \ge t$ (Furedi et al., 2020).
• Odd cycles $C_{2k+1}$:
  • $ex_r(n,Tr(C_{2k+1})) = \Theta(n^2)$ for all $r\ge2$ (Furedi et al., 2020).
• Forests/Trees:
  • $ex_r(n,Tr(F)) = \Theta(n)$ for forests with at least two edges (Furedi et al., 2020).

These cases are illuminated by classical results from Erdős, Frankl–Pach, Fűredi–Luo, and cover the bulk of Turán-type combinatorics for traces.

5. Relation to Generalized Turán Problems and Extremal Set Systems

The connection between trace-Turán numbers and classical Turán numbers is formalized by a set of inequalities:

$$ex(n,K_r,F) \le ex_r(n,\mathrm{B}F) \le ex_r(n,\mathrm{B}_{\mathrm{ind}F}),$$

where $\mathrm{B}F$ is the (possibly non-induced) Berge-$F$ subgraph, and $\mathrm{B}_{\mathrm{ind}F}$ corresponds to induced trace containment (Furedi et al., 2020). For non-bipartite graphs in an outerplanar class $\mathcal{G}^{\mathrm{tri}}$, only the $s=2$ shadow contributes, so $ex_r(n,Tr(F)) = O(ex(n,F))$ (Furedi et al., 2020).

Covering-based arguments and block designs (Steiner systems, Turán-type coverings) are repeatedly leveraged, especially for star and small forbidden subgraphs. These results encapsulate the interplay between fine combinatorial constructions and probabilistic methods, extending classical extremal set-system theorems to hypergraph traces (Qian et al., 2022).

6. Open Problems and Research Directions

Several research directions remain unresolved:

• Determining $\lim_{n\to\infty} ex_3(n,Tr(K_{2,t}))/n^{3/2}$ for each fixed $t\ge3$; whether current constants are sharp.
• Closing the gap between lower bounds via $K_s$-free constructions and upper bounds from codegree-covering arguments for general graphs $F$.
• Exact evaluation of $ex_r(n,Tr(K_{1,t}))$ for additional $r$ and $t$ values beyond the Steiner system-aligned instances (Qian et al., 2022).

For non-induced Berge-$F$ problems, threshold phenomena have been established—there exists $r_0(F)$ such that for $r\ge r_0(F)$, $ex_r(n,\mathrm{B}F) \ll n^2$, contrasting with monotonicity for induced trace-Turán numbers. This suggests underlying structural transitions in hypergraph trace containment and continues to drive fundamental questions in extremal combinatorics (Furedi et al., 2020).

7. Significance and Extensions Within Extremal Theory

The study of Turán numbers for traces synthesizes modern trace-Turán techniques with foundational extremal set-system theory, expanding the classical Turán paradigm into higher dimensions and induced substructure avoidance. The discipline links combinatorial design theory, probabilistic methods, shadow graphs, and core partitions, yielding both asymptotic and sometimes exact descriptions for a variety of forbidden configurations. These results not only deepen understanding of hypergraph extremal behavior but also anchor further research on precise limits, structural thresholds, and the generalization of extremal set-theoretic constructions in high-dimensional discrete mathematics (Qian et al., 2022, Furedi et al., 2020).