RU-ALLRUSSIAN 1974 Problem 8
The n points of a graph are each colored red or blue. At each move we select a point which differs in color from more than half of the points to which it it is joined and we change its color. Prove that this process must finish after a finite number of moves.
Dataset text NuminaMath olympiads. 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.