Group Connectivity under 3-Edge-Connectivity

Abstract

Let S,T be two distinct finite Abelian groups with |S|=|T|. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero S-flow if and only if it admits a nowhere-zero T-flow. Jaeger, Linial, Payan and Tarsi in 1992 introduced group connectivity as an extension of flow theory, and they asked whether such a relation holds for group connectivity analogy. It was negatively answered by Husek, Moheln\'ikov\'a and S\'amal in 2017 for graphs with edge-connectivity 2 for the groups S=Z4 and T=Z22. In this paper, we extend their results to 3-edge-connected graphs (including both cubic and general graphs), which answers open problems proposed by Husek, Moheln\'ikov\'a and S\'amal(2017) and Lai, Li, Shao and Zhan(2011). Combining some previous results, this characterizes all the equivalence of group connectivity under 3-edge-connectivity, showing that every 3-edge-connected S-connected graph is T-connected if and only if \S,T\≠ \Z4,Z22\.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…