HMMT 2018 T9
- Team
Evan has a simple graph with vertices and edges. Show that he can delete at least edges so that each vertex still has at least half of its original degree.
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.