HMMT 2009 S6
- Team 2
(a) [5] If a single vertex (and all its incident edges) is removed from a finite graph, show that the graph's chromatic number cannot decrease by more than 1.
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.
Similar problems
These problems have the most words in common with this statement.