Answers are grounded in this paper and cite their sources.
Given a positive integer n and a graph F, the Turán number $ex(n,F)$ is the maximum number of edges in an n-vertex simple graph that does not contain F as a subgraph. Let H be a graph and p a positive even integer. Let H⁽ᵖ⁾ denote the graph obtained from H by subdividing each of its edges $p-1$ times. We prove that ex(n,H⁽ᵖ⁾)=O(n1+(16/p)). This follows from a more general result that we establish, where different edges of H are allowed to be subdivided different numbers of times. Our result is closely related to the results of Jiang [J. Graph Theory, 67 (2011), pp. 139--152] and of Kostochka and Pyber [Combinatorica, 8 (1988), pp. 83--86] on topological minors.
No takes yet. Share an insight, caveat, or question.
Jiang et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: