Tight Bound on Treedepth in Terms of Pathwidth and Longest Path

We show that every graph with pathwidth strictly less than a that contains no path on 2^b vertices as a subgraph has treedepth at most 10 ab . The bound is best possible up to a constant factor.