Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412)

A conjecture of Seymour (see [\textit{N. Dean}, ``Open problems'', Graph structure theory, Contemporary Mathematics 147, 677--688 (1993)]) is proved stating that for every apex-forest \(H_1\) and outerplanar graph \(H_2\) there is an integer \(p\) such that every \(2\)-connected graph of pathwidth at least \(p\) contains \(H_1\) or \(H_2\) as a minor. Also, an independent proof has been recently obtained by \textit{T. N. Dang} and \textit{R. Thomas} [``Minors of two-connected graphs of large path-width'', Preprint, \url{arXiv:1712.04549} (2017)].