Abstract
For a graph , the -subdivision of , denoted , is the graph obtained by replacing the edges of with internally vertex-disjoint paths of length . In this paper, we prove that , which is tight for sufficiently large. This settles a conjecture of Conlon--Janzer--Lee, and improves on a substantial body of work by Conlon--Janzer--Lee and Jiang--Qiu.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.