# Solving Turán's tetrahedron problem for the ℓ2$\ell _2$ ‐norm

@article{Balogh2022SolvingTT, title={Solving Tur{\'a}n's tetrahedron problem for the ℓ2\$\ell \_2\$ ‐norm}, author={J{\'o}zsef Balogh and Felix Christian Clemen and Bernard Lidick'y}, journal={Journal of the London Mathematical Society}, year={2022}, volume={106} }

Turán's famous tetrahedron problem is to compute the Turán density of the tetrahedron K43$K_4^3$ . This is equivalent to determining the maximum ℓ1$\ell _1$ ‐norm of the codegree vector of a K43$K_4^3$ ‐free n$n$ ‐vertex 3‐uniform hypergraph. We introduce a new way for measuring extremality of hypergraphs and determine asymptotically the extremal function of the tetrahedron in our notion. The codegree squared sum, co2(G)$\mbox{co}_2(G)$ , of a 3‐uniform hypergraph G$G$ is the sum of codegrees…

## One Citation

### Counting r-graphs without forbidden configurations

- MathematicsJournal of Combinatorial Theory, Series B
- 2022

## References

SHOWING 1-10 OF 81 REFERENCES

### The minimum size of 3-graphs without a 4-set spanning no or exactly three edges

- MathematicsEur. J. Comb.
- 2011

### Hypergraphs with vanishing Turán density in uniformly dense hypergraphs

- MathematicsJ. Lond. Math. Soc.
- 2018

This work characterised those hypergraphs that are guaranteed to appear in any sufficiently large hypergraph $H$ of positive density and study related questions for $3-uniform hyper graphs with the additional assumption that $H $ has to be uniformly dense with respect to vertex sets.

### Three-graphs without two triples whose symmetric difference is contained in a third

- MathematicsDiscret. Math.
- 1974

### The Turán Number of F3,3

- MathematicsCombinatorics, Probability and Computing
- 2011

It is shown that for all n ≥ 6, the maximum number of edges in an F3,3-free 3-graph on n vertices is $\binom{n}{3} - \binom{\lfloor n/2 \rfloor}{3}.

### Embedding tetrahedra into quasirandom hypergraphs

- MathematicsJ. Comb. Theory, Ser. B
- 2016

### On extremal problems of graphs and generalized graphs

- Mathematics, Computer Science
- 1964

It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε( l, r), which means that all ther-tuples occur in ther-graph.

### Supersaturated graphs and hypergraphs

- MathematicsComb.
- 1983

We shall consider graphs (hypergraphs) without loops and multiple edges. Let ℒ be a family of so called prohibited graphs and ex (n, ℒ) denote the maximum number of edges (hyperedges) a graph…

### Generalizations of the removal lemma

- MathematicsComb.
- 2009

This paper proves that every sufficiently large k-uniform hypergraph on n vertices, which contains at most cnνFinduced copies of any hypergraph F ∈ ℱ on νF≤ C vertices can be changed by adding and deleting at most η.

### On 3-Hypergraphs with Forbidden 4-Vertex Configurations

- MathematicsSIAM J. Discret. Math.
- 2010

The proof is a rather elaborate application of Cauchy-Schwarz-type arguments presented in the framework of flag algebras by re-proving a few known tight results about hypergraph Turan densities and significantly improving numerical bounds for several problems for which the exact value is not known yet.

### Hypergraph Turán problems, Surveys in combinatorics 2011, London Math

- Soc. Lecture Note Ser., vol. 392, Cambridge Univ. Press, Cambridge,
- 2011