KöMaL 2008 B4065
Let be a simple graph in which the degree of every vertex is at least 2. Show that has a vertex, such that every edge drawn from that vertex belongs to a circuit.
Official text KöMaL. 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.