HMMT 2009 S4
- Team 2
Let be a finite graph in which every vertex has degree less than or equal to . Prove that the chromatic number of is less than or equal to .
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.