ELMO SL 2012 C4
A tournament on vertices contains no -cycles. Show that its vertices can be partitioned into two sets, each with size , such that the edges between vertices of the same set do not determine any -cycles.
Calvin Deng.
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.