Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs
Combinatorics
2023-09-06 v1
Abstract
In 1983, Bouchet proved that every bidirected graph with a nowhere-zero integer-flow has a nowhere-zero 216-flow, and conjectured that 216 could be replaced with 6. This paper shows that for cyclically 5-edge-connected bidirected graphs that number can be replaced with 8.
Cite
@article{arxiv.2309.00704,
title = {Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs},
author = {Matt DeVos and Kathryn Nurse and Robert Sámal},
journal= {arXiv preprint arXiv:2309.00704},
year = {2023}
}
Comments
14 pages