Rotation r-graphs
Copyright policy )Rotation r-graphs
We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-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 $r$-graphs.
9 pages
- University of Paderborn Germany
rotation graphs, Berge-Fulkerson conjecture, FOS: Mathematics, Mathematics - Combinatorics, hist, Structural characterization of families of graphs, \(r\)-graphs, Combinatorics (math.CO), Flows in graphs, Tutte's flow conjectures
rotation graphs, Berge-Fulkerson conjecture, FOS: Mathematics, Mathematics - Combinatorics, hist, Structural characterization of families of graphs, \(r\)-graphs, Combinatorics (math.CO), Flows in graphs, Tutte's flow conjectures
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!