2 problems

Let $G$ be a graph, and say that $G$ excludes a graph as an asymptotic minor if there is an integer $k$ such that the graph is not an asymptotic minor of $G$. Georgakopoulos–Papaso…

Coarse Menger-type conjecture. If a graph is not coarsely bottlenecked, it must contain $D_n$ as an asymptotic minor for every $n\in\mathbb{N}$.