Rotation $r$-graphs
Combinatorics
2023-04-26 v1
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.
Keywords
Cite
@article{arxiv.2304.12710,
title = {Rotation $r$-graphs},
author = {Eckhard Steffen and Isaak H. Wolf},
journal= {arXiv preprint arXiv:2304.12710},
year = {2023}
}
Comments
9 pages