Turán number of generalized triangles

Abstract: The family

S i g m a_{r}

consists of all

r

-graphs with three edges

D_{1}, D_{2}, D_{3}

such that

| D_{1} c a p D_{2} | = r - 1

and

D_{1} r i a n g l e D_{2} s u b s e t e q D_{3}

. A generalized triangle,

m a t h c a l T_{r} i n S i g m a_{r}

is an

r

-graph on

1, 2, l d o t s, 2 r - 1

with three edges

D_{1}, D_{2}, D_{3}

, such that

D_{1} = 1, 2, d o t s, r - 1, r, D_{2} = 1, 2, d o t s, r - 1, r + 1

and

D_{3} = r, r + 1, d o t s, 2 r - 1 .

Frankl and F"{u}redi conjectured that for all

r g e q 4

,

e x (n, S i g m a_{r}) = e x (n, m a t h c a l T_{r})

for all sufficiently large

n

and they also proved it for

r = 3

. Later, Pikhurko showed that the conjecture holds for

r = 4

. In this paper we determine

e x (n, m a t h c a l T_{5})

and

e x (n, m a t h c a l T_{6})

for sufficiently large

n

, proving the conjecture for

r = 5, 6

.

Recommendations

Cites Work

Cited In (24)

This page was built for publication: Turán number of generalized triangles