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 $\Phi_d1(G)$ and $\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 $G$, the two values $\Phi1_2(G)$ and $\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 $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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.