Turán-Type Extremal Problems in Simplicial Complexes

• Turán-type extremal problems for simplicial complexes study the maximum number of facets an n-vertex complex can have without containing a forbidden homeomorphic subcomplex.
• Recent advances apply probabilistic techniques, balanced multipartite reductions, and spectral methods to tighten bounds, such as improving the exponent from 3-1/5 to 8/3 for 2-complexes.
• Significant findings include tight Theta(n^(5/2)) bounds for surfaces like the torus and projective plane, alongside open questions on extending these techniques to higher dimensions and topological invariants.

A Turán-type extremal problem for simplicial complexes seeks the maximum size of a complex on $n$ vertices—the extremal number—avoiding a fixed forbidden subcomplex, often up to homeomorphism. In the two-dimensional case, this is closely tied to topological, combinatorial, and spectral analogues of classical Turán-type extremal results from graph and hypergraph theory, and probes deep connections between topology, probabilistic combinatorics, and extremal structural theory. Recent advances have improved universal exponent bounds, clarified structure for special classes, and illuminated longstanding open questions regarding surfaces and spheres.

1. Foundational Definitions and Framework

A two-dimensional simplicial complex $\mathcal{K}$ is specified by a vertex set $V$, with edges $E \subseteq \binom{V}{2}$ and triangular faces (facets) $F \subseteq \binom{V}{3}$, closed under inclusion: every triangle must have all edges present. The number of facets is denoted $f_2(\mathcal{K}) = |F|$. Given a fixed 2-dimensional simplicial complex $S$, a homeomorphic copy ("homeomorph") in a complex $G$ is a subcomplex created by subdividing some edges and triangles so that the underlying topological spaces are homeomorphic; equivalently, there exists a continuous bijection between their geometric realizations with a continuous inverse.

The topological Turán number $\operatorname{ex}_{\mathrm{top}}(n,S)$ is the largest number of facets that an $n$-vertex 2-complex may have without containing a homeomorph of $\mathcal{K}$0 (Keevash et al., 2020). More generally, the extremal number $\mathcal{K}$1 for a (possibly non-uniform) simplicial complex $\mathcal{K}$2 is the maximal number of faces in a labeled $\mathcal{K}$3-vertex complex without an isomorphic subcomplex to $\mathcal{K}$4 (strong embedding) (Conlon et al., 2023, Axenovich et al., 18 Aug 2025).

2. Universal Exponents and Main Theorems

Recent progress centers on determining sharp exponents for topological Turán numbers of 2-complexes. Keevash–Long–Narayanan–Scott established that for any fixed $\mathcal{K}$5 there exists $\mathcal{K}$6 such that (Keevash et al., 2020)

$\mathcal{K}$7

i.e., any $\mathcal{K}$8-vertex 2-complex with $\mathcal{K}$9 facets must contain a homeomorph of $V$0. This marked the first general bound in response to a question of Linial (2006).

Later, a further improvement was achieved: for any 2-dimensional $V$1, $V$2, strictly improving the exponent $V$3 (i.e., $V$4) to $V$5 (Sankar, 2024). For central surfaces such as the torus $V$6 and projective plane $V$7, the true exponent is $V$8, and this tight bound extends to all closed orientable and non-orientable surfaces via connected-sum constructions.

The exponents can be summarized as follows:

Object / Class	Upper Bound	Lower Bound
Arbitrary 2-complex	$V$9	Universal, tight for some $E \subseteq \binom{V}{2}$0
Torus / RP$E \subseteq \binom{V}{2}$1	$E \subseteq \binom{V}{2}$2	$E \subseteq \binom{V}{2}$3

For higher dimensions $E \subseteq \binom{V}{2}$4 (e.g., spheres $E \subseteq \binom{V}{2}$5), the current best bounds are $E \subseteq \binom{V}{2}$6 and conditional lower bounds $E \subseteq \binom{V}{2}$7; the conjectured true exponent matches the conditional lower (Newman et al., 2024). For many concrete examples—e.g., downward-closed complexes or cycle/matching "sandwiches"—precise extremal numbers are determined via generating sets and symmetry (Axenovich et al., 18 Aug 2025, Conlon et al., 2023).

3. Combinatorial and Probabilistic Methodologies

Key proof techniques include reductions to balanced multipartite 3-uniform hypergraphs and application of dependent random choice for local density increments in link graphs. For instance, to embed homeomorphs, one identifies a vertex $E \subseteq \binom{V}{2}$8 with dense link graph $E \subseteq \binom{V}{2}$9, cleans bad pairs/triples via random deletion, and embeds an auxiliary bipartite graph encoding the forbidden complex with admissible cycles (Keevash et al., 2020). Dense link analysis guarantees a homeomorph under sufficient density.

For CW-complex realizations, disk-coverability criteria are introduced: induced 4-cycles in the 1-skeleton shadow of a host 3-graph must bound "disk" subcomplexes. Probabilistic partitioning then ensures those boundaries are realized disjointly (Sankar, 2024).

All constructions take care to balance the density of bad structures—admissible cycles, high-degree faces, etc.—via probabilistic arguments, multiplicity counting, and sharp extremal inequalities (such as path-counting for disk failure).

4. Generalized and Spectral Turán-Type Bounds

Connections with uniform hypergraph Turán numbers are universal: for a $F \subseteq \binom{V}{3}$0-dimensional complex $F \subseteq \binom{V}{3}$1, the extremal number satisfies

$F \subseteq \binom{V}{3}$2

where $F \subseteq \binom{V}{3}$3 is the family whose downward-closure contains $F \subseteq \binom{V}{3}$4 (Axenovich et al., 18 Aug 2025). For many classes—e.g., trivial complexes, matchings, cycles—these bounds are tight up to error $F \subseteq \binom{V}{3}$5. In general, extremal behavior may be much larger or smaller due to layer incompleteness and combinatorial jumps.

Spectral approaches, using signless Laplacians and Betti numbers, provide additional upper bounds. For pure $F \subseteq \binom{V}{3}$6-dimensional complexes with no $F \subseteq \binom{V}{3}$7-holes ($F \subseteq \binom{V}{3}$8), the spectral radius satisfies

$F \subseteq \binom{V}{3}$9

with equality precisely for the "tented complex" $f_2(\mathcal{K}) = |F|$0 (Fan et al., 30 Jul 2025). Upper bounds on Betti numbers yield parallel extremal bounds, and the spectral methods can recover leading order exponents for spherical Turán-type problems, albeit typically with weaker constants.

5. Representative Constructions and Explicit Examples

Extremal examples for these bounds include:

• Tented complex $f_2(\mathcal{K}) = |F|$1: maximal for spectral radius with no $f_2(\mathcal{K}) = |F|$2-holes.
• Perfect matching split construction: for two-layer incomplete complexes, partitions $f_2(\mathcal{K}) = |F|$3 and spreads maximal size across dimensions (Conlon et al., 2023).
• Complete up to dimension $f_2(\mathcal{K}) = |F|$4 plus an $f_2(\mathcal{K}) = |F|$5-free $f_2(\mathcal{K}) = |F|$6-graph: yields tight asymptotic bound for certain uniform forbidden complexes.

For 2-complexes generated by a small number of triples, non-trivial behavior is exhibited: e.g., complexes $f_2(\mathcal{K}) = |F|$7, $f_2(\mathcal{K}) = |F|$8 have extremal number $f_2(\mathcal{K}) = |F|$9, not matching the trivial lower bound (Axenovich et al., 18 Aug 2025). These examples reveal new phenomena such as incompleteness and layer interaction unprecedented in classical hypergraph settings.

6. Open Questions, Conjectures, and Generalizations

Major open problems include:

• Determining for which complexes $S$0 the trivial lower bound $S$1 is tight (Axenovich et al., 18 Aug 2025, Conlon et al., 2023).
• Establishing sharp exponents for sphere Turán problems in all dimensions, potentially matching the conditional exponent $S$2 (Newman et al., 2024).
• Characterizing all real exponents arising as growth rates $S$3 in simplicial extremal functions; all integers $S$4 are known to occur, while the rational case is open.
• Extending Turán-type bounds to joint constraints on multiple Betti numbers, non-pure complexes, or other topological invariants (Fan et al., 30 Jul 2025).
• Improving universal exponents, particularly by enhancing bipartite Turán bounds for shadow graphs in CW-realizations (Sankar, 2024).
• Exploring signless $S$5-Laplacian approaches and normalized Laplacian extremals.

The emerging synthesis of topological, spectral, and probabilistic arguments defines a new horizon in combinatorial extremal theory. Techniques are rapidly advancing—in particular, by identifying structural symmetries, leveraging density increments, and introducing concepts such as disk-coverability, new tight bounds and universal laws are within reach for Turán-type problems in simplicial complexes.