{"paper":{"title":"Turan numbers of bipartite subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tao Jiang, Yu Qiu","submitted_at":"2019-05-22T07:32:40Z","abstract_excerpt":"Given a graph $H$, the Tur\\'an number $ex(n,H)$ is the largest number of edges in an $H$-free graph on $n$ vertices. We make progress on a recent conjecture of Conlon, Janzer, and Lee on the Tur\\'an numbers of bipartite graphs, which in turn yields further progress on a conjecture of Erd\\H{o}s and Simonovits. Let $s,t,k\\geq 2$ be integers. Let $K_{s,t}^k$ denote the graph obtained from the complete bipartite graph $K_{s,t}$ by replacing each edge $uv$ in it with a path of length $k$ between $u$ and $v$ such that the $st$ replacing paths are internally disjoint. It follows from a general theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08994","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"}