SCHWEITZER 2010 Problem 2
Let be a countably infinite, -regular, connected, vertex-transitive graph. Show that there is a complete pairing in .
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.