KöMaL 2006 B3930
Prove that by drawing some noncrossing diagonals it can be divided into triangles such that each vertex of the polygon belongs to an odd number of them.
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.