{"paper":{"title":"Some extremal results on K_{s,t}-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gennian Ge, Tao Zhang","submitted_at":"2019-03-08T00:54:00Z","abstract_excerpt":"For graphs $H$ and $F$, let $\\text{ex}(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 $t\\ge 2m-3\\ge3$, \\[\\text{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 $k\\ge3$ and $t\\ge(k-1)(s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03233","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}