The strong coarse Menger conjecture
Let be a finite or infinite graph, and let . An - path is a path with at least one end in and at least one end in . For sets , let be the infimum of the distances between their vertices. For and , let
A set is -centered if for some with . The strong coarse Menger conjecture. There exists a real number such that for any graph , subsets of and positive integers , either contains - paths pairwise at distance at least , or there exists a set -centered in intersecting all - paths. This is a large-scale analogue of Menger's theorem.
References
Status
- Refuted: Tony Nguyen, Alex Scott, and Paul Seymour. A counterexample to the coarse Menger conjecture (Journal of Combinatorial Theory, Series B, 2025) https://arxiv.org/abs/2403.05630
Source: Chun-Hung Liu, “Coarse Menger property of quasi-minor excluded graphs and length spaces”, arXiv:2605.10068 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.