Manhattan and Chebyshev flows
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) and d∞(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 G, the two values 12(G) and ∞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 t-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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.