KMO 2019 Problem 8
There are two countries and , where each countries have airports. There are some two-way flights among airports of and , so that each airport has exactly flights. There might be multiple flights among two airports; and there are no flights among airports of the same country. A travel agency wants to plan an exotic traveling course which travels through all airports exactly once, and returns to the initial airport. If denotes the number of all exotic traveling courses, then prove that is an even integer.
(Here, note that two exotic traveling courses are different if their starting place are different.)
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.