Some extremal results on K_{s,t}-free graphs

arXiv1903.03233MaRDI QIDQ6315249FDOQ6315249

Authors: Tao Zhang, Gennian Ge 

Publication date: 7 March 2019

Abstract: For graphs $H$ and $F$, let $extex(n,H,F)$ be the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices. The study of this function, which generalizes the well-known Tur'{a}n number of graphs, was systematically studied by Alon and Shikhelman recently. In this paper, we show that for any $m$ and $tge2m-3ge3$, [ ext{ex}(n,K_{m},K_{2,t})=Theta(n^{frac{3}{2}}).] This result improves some results of Alon and Shikhelman (J. Combin. Theory Ser. B, 121:146-172, 2016). We also study the $k$-partite $K_{s,t}$-free graph, we show that for any $kge3$ and $tge(k-1)(s-1)!+1$, [ ext{ex}_{chile k}(n,K_{s,t})gefrac{k-1}{2k}n^{2-1/s}+o(n^{2-1/s}).] Moreover, we give a new construction of $3$-partite $K_{2,2t+1}$-free graphs with many edges.

This page was built for publication: Some extremal results on K_{s,t}-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6315249)