MathDB
Graph and degrees

Source: Iran PPCE 2004

January 9, 2009
functioncombinatorics proposedcombinatorics

Problem Statement

For a subset S S of vertices of graph G G, let Λ(S) \Lambda(S) be the subset of all edges of G G such that at least one of their ends is in S S. Suppose that G G is a graph with m m edges. Let d:V(G)N{0} d^*: V(G)\longrightarrow\mathbb N\cup\{0\} be a function such that a) \sum_{u}d^*(u)\equal{}m. b) For each subset S S of V(G) V(G): uSd(u)Λ(S) \sum_{u\in S}d^*(u)\leq|\Lambda(S)| Prove that we can give directions to edges of G G such that for each edge e e, d^\plus{}(e)\equal{}d^*(e).