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

-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,

e x t {c o}_{2} (G)

, of a

3

-uniform hypergraph

G

is the sum of codegrees squared

d (x, y)^{2}

over all pairs of vertices

x y

, or in other words, the square of the

e l l_{2}

-norm of the codegree vector of the pairs of vertices. We define

e x t {e x c o}_{2} (n, H)

to be the maximum

e x t {c o}_{2} (G)

over all

H

-free

n

-vertex

3

-uniform hypergraphs

G

. We use flag algebra computations to determine asymptotically the codegree squared extremal number for

K_{4}^{3}

and

K_{5}^{3}

and additionally prove stability results. In particular, we prove that the extremal

K_{4}^{3}

-free hypergraphs in

e l l_{2}

-norm have approximately the same structure as one of the conjectured extremal hypergraphs for Tur'an's conjecture. Further, we prove several general properties about

e x t {e x c o}_{2} (n, H)

including the existence of a scaled limit, blow-up invariance and a supersaturation result.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

Uses Software

SageMath

This page was built for publication: Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133947)