English

Manhattan and Chebyshev flows

Combinatorics 2025-10-28 v1

Abstract

We investigate multidimensional nowhere-zero flows of bridgeless graphs. By extending the established use of the Euclidean norm, this paper considers the Manhattan and Chebyshev norms, leading to the definition of the flow numbers Φd1(G)\Phi_d^1(G) and Φd(G)\Phi_d^\infty(G), respectively. These flow numbers are always rational and in two dimensions, they distinguish between cubic graphs that are 3-edge-colourable and those that are not. We also prove that, for any bridgeless graph GG, the two values Φ21(G)\Phi^1_2(G) and Φ2(G)\Phi^\infty_2(G) are the same. We give new upper and lower bounds and structural results, and we find connections with cycle covers. Finally, we introduce the idea of tt-flow-pairs, which comes from a method used in Seymour's proof of the 6-flow theorem, and we propose new conjectures that could be stronger than Tutte's famous 5-flow conjecture.

Keywords

Cite

@article{arxiv.2510.22234,
  title  = {Manhattan and Chebyshev flows},
  author = {Lukáš Gáborik and Sascha Kurz and Giuseppe Mazzuoccolo and Jozef Rajník and Florian Rieg},
  journal= {arXiv preprint arXiv:2510.22234},
  year   = {2025}
}
R2 v1 2026-07-01T07:05:27.365Z