Turán numbers of complete 3-uniform Berge-hypergraphs

Publication date 14 September 2018

Abstract: Given a family

m a t h c a l F

of

r

-graphs, the Tur'{a}n number of

m a t h c a l F

for a given positive integer

N

, denoted by

e x (N, m a t h c a l F)

, is the maximum number of edges of an

r

-graph on

N

vertices that does not contain any member of

m a t h c a l F

as a subgraph. For given

r g e q 3

, a complete

r

-uniform Berge-hypergraph, denoted by {

K_{n}^{(r)}

}, is an

r

-uniform hypergraph of order

n

with the core sequence

v_{1}, v_{2}, l d o t s, v_{n}

as the vertices and distinct edges

e_{i j},

1 l e q i < j l e q n,

where every

e_{i j}

contains both

v_{i}

and

v_{j}

. Let

m a t h c a l F_{n}^{(r)}

be the family of complete

r

-uniform Berge-hypergraphs of order

n .

We determine precisely

e x (N, m a t h c a l F_{n}^{(3)})

for

n g e q 13

. We also find the extremal hypergraphs avoiding

m a t h c a l F_{n}^{(3)}

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Turán numbers of complete 3-uniform Berge-hypergraphs