Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees

DOI10.1002/JGT.22231MaRDI QIDQ4581285zbMATH OpenOpenAlexFDO

Authors Miaomiao Han, Hong-Jian Lai, Jiaao Li

Publication date 16 August 2018

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.04581

zbMATH Keywords

group connectivityedge-disjoint spanning trees3-flow conjecture

Mathematics Subject Classification ID

Trees (05C05) Flows in graphs (05C21) Connectivity (05C40)

Abstract: Given a zero-sum function $$ with $$, an orientation $D$ of $G$ with $$ in $mathbb{Z}_3$ for every vertex $vinV(G)$ is called a $$-orientation. A graph $G$ is $mathbb{Z}_3$-connected if $G$ admits a $$- orientation for every zero-sum function $$. Jaeger et al. conjectured that every $5$-edge-connected graph is $mathbb{Z}_3$-connected. A graph is $langlemathbb{Z}_{3}angle$-extendable at vertex $v$ if any pre-orientation at $v$ can be extended to a $$-orientation of $G$ for any zero-sum function $$. We observe that if every $5$-edge-connected essentially $6$-edge-connected graph is $langlemathbb{Z}_{3}angle$-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'{a}sz et al., we prove that every graph with at least 4 edge-disjoint spanning trees is $mathbb{Z}_3$-connected. Consequently, every $5$-edge-connected essentially $23$-edge-connected graph is $langlemathbb{Z}_{3}angle$-extendable at degree five vertex.

Recommendations

• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs
• Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
• A note on nowhere-zero 3-flows and \(Z_3\)-connectivity
• Nowhere-zero 3-flows of highly connected graphs
• Nowhere-zero 3-flows in triangularly connected graphs
• Nowhere‐zero 3‐flows in locally connected graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
• Nowhere-zero 3-flow of graphs with small independence number

Cited in

(14)

• Equivalent versions of group-connectivity theorems and conjectures
• Packing spanning trees in highly essentially connected graphs
• Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
• Spectral radius and edge‐disjoint spanning trees
• Group connectivity in \(J_3\) line graphs
• \({\mathbb{Z}_3}\)-connectivity of 4-edge-connected triangular graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Group connectivity under 3‐edge‐connectivity
• Modulo orientations with bounded out-degrees
• Contractible graphs for flow index less than three
• On 3-flow-critical graphs
• Nowhere-zero 3-flow of graphs with small independence number
• All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
• Flow extensions and group connectivity with applications

This page was built for publication: Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees

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