Nowhere-zero 9-flows in 3-edge-connected signed graphs

MaRDI QIDQ6264669zbMATH OpenFDO

Authors Fan Yang, Sanming Zhou

Publication date 19 August 2015

Mathematics Subject Classification ID

Flows in graphs (05C21) Signed and weighted graphs (05C22)

Abstract: A signed graph is a graph with a positive or negative sign on each edge. Regarding each edge as two half edges, an orientation of a signed graph is an assignment of a direction to each of its half edges such that the two half edges of a positive edge receive the same direction and that of a negative edge receive opposite directions. A signed graph with such an orientation is called a bidirected graph. A nowhere-zero $k$-flow of a bidirected graph is an assignment of an integer from $-(k-1),ldots,-1,1,ldots,(k-1)$ to each of its half edges such that Kirchhoff's law is respected, that is, the total incoming flow is equal to the total outgoing flow at each vertex. A signed graph is said to admit a nowhere-zero $k$-flow if it has an orientation such that the corresponding bidirected graph admits a nowhere-zero $k$-flow. It was conjectured by Bouchet that every signed graph admitting a nowhere-zero $k$-flow for some integer $kge2$ admits a nowhere-zero 6-flow. In this paper we prove that every $3$-edge-connected signed graph admitting a nowhere-zero $k$-flow for some $k$ admits a nowhere-zero $9$-flow.

This page was built for publication: Nowhere-zero 9-flows in 3-edge-connected signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264669)