An Improved Error Term for Tur\acute{\rm a}n Number of Expanded Non-degenerate 2-graphs

Abstract: For a 2-graph

F

, let

H_{F}^{(r)}

be the

r

-graph obtained from

F

by enlarging each edge with a new set of

r - 2

vertices. We show that if

c h i (F) = e l l > r g e q 2

, then

m e x (n, H_{F}^{(r)}) = t_{r} (n, e l l - 1) + T h e t a (m b i e x (n, F) n^{r - 2}),

where

t_{r} (n, e l l - 1)

is the number of edges of an

n

-vertex complete balanced

e l l - 1

partite

r

-graph and

m b i e x (n, F)

is the extremal number of the decomposition family of

F

. Since

m b i e x (n, F) = O (n^{2 - g a m m a})

for some

g a m m a > 0

, this improves on the bound

m e x (n, H_{F}^{(r)}) = t_{r} (n, e l l - 1) + o (n^{r})

by Mubayi (2016). Furthermore, our result implies that

m e x (n, H_{F}^{(r)}) = t_{r} (n, e l l - 1)

when

F

is edge-critical, which is an extension of the result of Pikhurko (2013).

This page was built for publication: An Improved Error Term for Tur$\acute{\rm a}$n Number of Expanded Non-degenerate 2-graphs