English

Group Connectivity under $3$-Edge-Connectivity

Combinatorics 2020-09-16 v1

Abstract

Let S,TS,T be two distinct finite Abelian groups with S=T|S|=|T|. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero SS-flow if and only if it admits a nowhere-zero TT-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 Hu\v{s}ek, Moheln\'{i}kov\'{a} and \v{S}\'{a}mal in 2017 for graphs with edge-connectivity 2 for the groups S=Z4S=\mathbb{Z}_4 and T=Z22T=\mathbb{Z}_2^2. In this paper, we extend their results to 33-edge-connected graphs (including both cubic and general graphs), which answers open problems proposed by Hu\v{s}ek, Moheln\'{i}kov\'{a} and \v{S}\'{a}mal(2017) and Lai, Li, Shao and Zhan(2011). Combining some previous results, this characterizes all the equivalence of group connectivity under 33-edge-connectivity, showing that every 33-edge-connected SS-connected graph is TT-connected if and only if {S,T}{Z4,Z22}\{S,T\}\neq \{\mathbb{Z}_4,\mathbb{Z}_2^2\}.

Keywords

Cite

@article{arxiv.2009.06867,
  title  = {Group Connectivity under $3$-Edge-Connectivity},
  author = {Miaomiao Han and Jiaao Li and Xueliang Li and Meiling Wang},
  journal= {arXiv preprint arXiv:2009.06867},
  year   = {2020}
}

Comments

to appear in Journal of Graph Theory

R2 v1 2026-06-23T18:32:49.315Z