Hypergraph Turán numbers of vertex disjoint cycles

Abstract: The Tur'an number of a

k

-uniform hypergraph

H

, denoted by

e x_{k} l e f t (n; H i g h t)

, is the maximum number of edges in any

k

-uniform hypergraph

F

on

n

vertices which does not contain

H

as a subgraph. Let

m a t h c a l C_{e l l}^{l e f t (k i g h t)}

denote the family of all

k

-uniform minimal cycles of length

e l l

,

m a t h c a l S (e l l_{1}, l d o t s, e l l_{r})

denote the family of hypergraphs consisting of unions of

r

vertex disjoint minimal cycles of length

e l l_{1}, l d o t s, e l l_{r}

, respectively, and

m a t h b b C_{e l l}^{l e f t (k i g h t)}

denote a

k

-uniform linear cycle of length

e l l

. We determine precisely

e x_{k} l e f t (n; m a t h c a l S (e l l_{1}, l d o t s, e l l_{r}) i g h t)

and

e x_{k} l e f t (n; m a t h b b C_{e l l_{1}}^{l e f t (k i g h t)}, l d o t s, m a t h b b C_{e l l_{r}}^{l e f t (k i g h t)} i g h t)

for sufficiently large

n

. The results extend recent results of F"{u}redi and Jiang who determined the Tur'an numbers for single

k

-uniform minimal cycles and linear cycles.

Recommendations

Cites work

Cited in

(18)

This page was built for publication: Hypergraph Turán numbers of vertex disjoint cycles