[Paper Review] Nowhere-zero flows on signed eulerian graphs

Edita Máčajová, Martin Škoviera|arXiv (Cornell University)|Aug 7, 2014

Advanced Mathematical Modeling in Engineering7 references4 citations

TL;DR

This paper classifies signed eulerian graphs by their nowhere-zero flow numbers, proving that every signed eulerian graph with an integer nowhere-zero flow admits a nowhere-zero 4-flow. It characterizes graphs with flow numbers 2, 3, and 4, and establishes conditions for the existence of $A$-flows over arbitrary abelian groups $A$, resolving long-standing open questions in signed graph flows.

ABSTRACT

This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We generalise the well-known fact about the existence of nowhere-zero $2$-flows in eulerian graphs by proving that every signed eulerian graph that admits an integer nowhere-zero flow has a nowhere-zero $4$-flow. We also characterise signed eulerian graphs with flow number $2$, $3$, and $4$, as well as those that do not have an integer nowhere-zero flow. Finally, we discuss the existence of nowhere-zero $A$-flows on signed eulerian graphs for an arbitrary abelian group~$A$.

Motivation & Objective

• To characterize signed eulerian graphs according to their nowhere-zero flow numbers (2, 3, 4, or non-existent).
• To generalize the classical nowhere-zero 2-flow result for eulerian graphs to the signed case.
• To determine the exact conditions under which a signed eulerian graph admits a nowhere-zero $A$-flow for an arbitrary abelian group $A$.
• To resolve open problems regarding flow numbers in signed eulerian graphs, particularly for $k$-flows with $k < 6$.
• To establish a complete characterization of signed eulerian graphs with no integer nowhere-zero flow, linking it to unbalanced edge removal and signature structure.

Proposed method

• Uses the equivalence between signed graphs and bidirected graphs, leveraging vertex-switching invariance to define stable flows.
• Applies induction on the number of vertices and edge contraction techniques to reduce counterexamples to minimal cases.
• Employs the concept of triply odd decomposition and stable flows to analyze graphs with flow number 3.
• Utilizes group-theoretic arguments to characterize $A$-flows, depending on the presence of involutions or elements of order ≥4.
• Applies Theorem 5.2 on 6-regular antibalanced graphs to show that such graphs must admit a triply odd decomposition.
• Uses decomposition theorems to cover graphs with odd edge counts by even eulerian subgraphs, enabling flow construction via group elements.

Experimental results

Research questions

• RQ1 What is the exact characterization of signed eulerian graphs with nowhere-zero 2-flows?
• RQ2 Under what conditions does a signed eulerian graph admit a nowhere-zero 3-flow?
• RQ3 What is the minimal flow number for signed eulerian graphs that do not admit a 2- or 3-flow?
• RQ4 When does a signed eulerian graph fail to admit any integer nowhere-zero flow?
• RQ5 For which abelian groups $A$ does a signed eulerian graph admit a nowhere-zero $A$-flow?

Key findings

• A signed eulerian graph has no nowhere-zero integer flow if and only if it is unbalanced and removing one edge makes it balanced.
• A signed eulerian graph has a nowhere-zero 2-flow if and only if it has an even number of negative edges.
• A signed eulerian graph has a nowhere-zero 3-flow if and only if it can be decomposed into three eulerian subgraphs with an odd number of negative edges, all sharing a common vertex.
• Every signed eulerian graph that admits an integer nowhere-zero flow has a nowhere-zero 4-flow, and this bound is tight.
• For an abelian group $A$, a signed eulerian graph admits a nowhere-zero $A$-flow if $A$ contains an involution, or if $A \cong \mathbb{Z}_3$ and the graph is triply odd.
• A signed eulerian graph admits a nowhere-zero $A$-flow for $A$ not isomorphic to $\mathbb{Z}_3$ and with no involution if and only if it is not tightly unbalanced.