Modulo orientations with bounded out-degrees
Combinatorics
2022-05-17 v3
Abstract
Let be a graph, let be a positive integer, and let be a mapping with . In this paper, we show that if is -edge-connected, then it has an orientation such that for each vertex , ; also if contains edge-disjoint spanning trees, then it admits such an orientation but by imposing greater out-degree bounds.
Keywords
Cite
@article{arxiv.1702.07039,
title = {Modulo orientations with bounded out-degrees},
author = {Morteza Hasanvand},
journal= {arXiv preprint arXiv:1702.07039},
year = {2022}
}
Comments
Some removed parts of the former version will be published in some new papers