Nowhere-zero 33-flow and Z3\mathbb{Z}_3-connectedness in Graphs with Four Edge-disjoint Spanning Trees

preprint2016arXivOpen access

Abstract

Given a zero-sum function β:V(G)→Z3β: V(G) \rightarrow \mathbb{Z}_3 with ∑v∈V(G)β(v)=0\sum_{v\in V(G)}β(v)=0, an orientation DD of GG with dD+(v)−dD−(v)=β(v)d^+_D(v)-d^-_D(v)= β(v) in Z3\mathbb{Z}_3 for every vertex v∈V(G)v\in V(G) is called a ββ-orientation. A graph GG is Z3\mathbb{Z}_3-connected if GG admits a ββ- orientation for every zero-sum function ββ. Jaeger et al. conjectured that every 55-edge-connected graph is Z3\mathbb{Z}_3-connected. A graph is ⟨Z3⟩\langle\mathbb{Z}_3\rangle-extendable at vertex vv if any pre-orientation at vv can be extended to a ββ-orientation of GG for any zero-sum function ββ. We observe that if every 55-edge-connected essentially 66-edge-connected graph is ⟨Z3⟩\langle\mathbb{Z}_3\rangle-extendable at any degree five vertex, then the above mentioned conjecture by Jaeger et al. holds as well. Furthermore, applying the partial flow extension method of Thomassen and of Lovász et al., we prove that every graph with at least 4 edge-disjoint spanning trees is Z3\mathbb{Z}_3-connected. Consequently, every 55-edge-connected essentially 2323-edge-connected graph is ⟨Z3⟩\langle\mathbb{Z}_3\rangle-extendable at degree five vertex.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.