BY-MO 2004 Problem 1
A connected graph with at least one vertex of an odd degree is given. Show that one can color the edges of the graph red and blue in such a way that, for each vertex, the absolute difference between the numbers of red and blue edges at that vertex does not exceed 1.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.