1 problem

Induced Menger conjecture. If a graph admits no $k$ pairwise non-adjacent paths between $u$ and $v$, then it admits a set of $f(k)$ neighborhoods disconnecting $u$ from $v$, for so…