Tight bound on treedepth in terms of pathwidth and longest path
Abstract
We show that every graph with pathwidth strictly less than a that contains no path on 2b vertices as a subgraph has treedepth at most 10ab. The bound is best possible up to a constant factor.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.