Geometric description of $d$-dimensional flows of a graph

TL;DR

This paper introduces a geometric framework for understanding $d$-dimensional flows on graphs, linking their existence to cycle double covers and providing bounds on their flow numbers.

Contribution

It offers a geometric description of $d$-dimensional flows and establishes a connection between these flows and cycle double covers, with bounds on flow numbers.

Findings

Geometric characterization of $d$-dimensional flows.

Equivalence between cycle double covers and certain flows.

Upper bounds for flow numbers based on cycle double covers.

Abstract

A $d$-dimensional nowhere-zero $r$-flow on a graph $G$, an $(r,d)$-NZF from now on, is a flow where the value on each edge is an element of $\mathbb{R}^d$ whose (Euclidean) norm lies in the interval $[1, r-1]$. Such a notion is a natural generalization of the well-known concept of a circular nowhere-zero $r$-flow (i.e.\ $d = 1$). The minimum of the real numbers $r$ such that a graph $G$ admits an $(r, d)$-NZF is called the $d$-dimensional flow number of $G$ and is denoted by $\phi_d(G)$. In this paper we provide a geometric description of some $d$-dimensional flows on a graph $G$, and we prove that the existence of a suitable cycle double cover of $G$ is equivalent, for $G$, to admit such a geometrically constructed $(r,d)$-NZF. This geometric approach allows us to provide upper bounds for $\phi_{d-2}(G)$ and $\phi_{d-1}(G)$, assuming that $G$ admits an (oriented) $d$-cycle double cover.