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

## TL;DR

This paper refines the upper bound for the Turán number of expanded non-degenerate 2-graphs, improving previous results and extending known cases where the extremal number equals a complete balanced partite r-graph.

## Contribution

It provides a sharper error term for the Turán number of expanded 2-graphs, extending results to edge-critical graphs and improving bounds over Mubayi's 2016 work.

## Key findings

- Improved error term for Turán number of expanded 2-graphs.
- Shows equality with complete balanced partite r-graph for edge-critical F.
- Extends previous bounds and results in extremal graph theory.

## 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 $\chi(F)=\ell>r \geq 2$, then $ {\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)+ \Theta( {\rm biex}(n,F)n^{r-2}),$ where $t_r (n,\ell-1)$ is the number of edges of an $n$-vertex complete balanced $\ell-1$ partite $r$-graph and ${\rm biex}(n,F)$ is the extremal number of the decomposition family of $F$. Since ${\rm biex}(n,F)=O(n^{2-\gamma})$ for some $\gamma>0$, this improves on the bound ${\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)+ o(n^r)$ by Mubayi (2016). Furthermore, our result implies that ${\rm ex}(n,H_F^{(r)})= t_r (n,\ell-1)$ when $F$ is edge-critical, which is an extension of the result of Pikhurko (2013).