We prove a conjecture of Seymour (1993) stating that for every apex-forest H1 and out-erplanar graph H2 there is an integer p such that every 2-connected graph of pathwidth at least p contains H1 or H2 as a minor. An independent proof was recently obtained by Dang and Thomas [3].
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth / Huynh, T.; Joret, G.; Micek, P.; Wood, D. R.. - In: COMBINATORICA. - ISSN 0209-9683. - 40:6(2020), pp. 839-868. [10.1007/s00493-020-3941-3]
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth
Huynh T.;Joret G.;
2020
Abstract
We prove a conjecture of Seymour (1993) stating that for every apex-forest H1 and out-erplanar graph H2 there is an integer p such that every 2-connected graph of pathwidth at least p contains H1 or H2 as a minor. An independent proof was recently obtained by Dang and Thomas [3].File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
