# 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}
}
• Published 23 August 2021
• Mathematics
• Journal of the London Mathematical Society
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…
1 Citations

### Counting r-graphs without forbidden configurations

• Mathematics
Journal of Combinatorial Theory, Series B
• 2022

## References

SHOWING 1-10 OF 81 REFERENCES

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

• Mathematics
J. Lond. Math. Soc.
• 2018

### On extremal problems of graphs and generalized graphs

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

• Mathematics
Comb.
• 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

• Mathematics
Comb.
• 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

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