The extremal number of longer subdivisions
The extremal number of longer subdivisions
For a multigraph F, the k-subdivision of F is the graph obtained by replacing the edges of F with pairwise internally vertex-disjoint paths of length k + 1 . Conlon and Lee conjectured that if k is even, then the ( k − 1 ) -subdivision of any multigraph has …