Rotation -graphs
arXiv:2304.12710 · doi:10.1016/j.disc.2023.113457
Abstract
We study rotation -graphs and show that for every -graph of odd regularity there is a simple rotation -graph such that can be obtained form by a finite number of -cut reductions. As a consequence, some hard conjectures as the (generalized) Berge-Fulkerson Conjecture and Tutte's 3- and 5-flow conjecture can be reduced to rotation -graphs.
9 pages