A counterexample to the coarse Menger conjecture

<p>Menger’s well-known theorem from 1927 characterizes when it is possible to find k vertex-disjoint paths between two sets of vertices in a graph G. Recently, Georgakopoulos and Papasoglu and, independently, Albrechtsen, Huynh, Jacobs, Knappe and Wollan conjectured a coarse analogue of Menger...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Nguyen, T, Scott, A, Seymour, P
Materialtyp: Journal article
Språk:English
Publicerad: Elsevier 2025