a simple finite graph problem
Source: Danube 2015 p2
July 22, 2019
graph theorygraphcombinatoricsEven
Problem Statement
Show that the edges of a connected simple (no loops and no multiple edges) finite graph can be oriented so that the number of edges leaving each vertex is even if and only if the total number of edges is even