Let G(V, E) be a finite, undirected graph, and let l(X) be a set function on 2V. When can the edges of G be oriented so that the indegree of every subset X is at least l(X)? A necessary and sufficient condition is given for the existence of such an orientation when l(X) is "convex".
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics