PAMO 2007 Problem 3
- Day 1
In a country, towns are connected by roads. Each town is directly connected to exactly three other towns. Show that there exists a town from which you can make a round-trip, without using the same road more than once, and for which the number of roads used is not divisible by . (Not all towns need to be visited.)
Dataset text AI-MO AoPS. 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.