Modulo orientations with bounded out-degrees

Abstract

Let G be a graph, let k be a positive integer, and let p:V(G)→ Zk be a mapping with |E(G)| kΣv∈ V(G)p(v) . In this paper, we show that if G is (3k-3)-edge-connected, then it has an orientation such that for each vertex v, |d+G(v)-dG(v)/2| < k; also if G contains 2k-2 edge-disjoint spanning trees, then it admits such an orientation but by imposing greater out-degree bounds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…