HMMT 2020 U18
- Guts
- Answer
A vertex-induced subgraph is a subset of the vertices of a graph together with any edges whose endpoints are both in this subset. An undirected graph contains 10 nodes and edges, with no loops or multiple edges. What is the minimum possible value of such that this graph must contain a nonempty vertex-induced subgraph where all vertices have degree at least 5 ?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
31
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.