BALTIC-WAY 2012 Problem 8
A directed graph does not contain directed cycles. The number of edges in any directed path does not exceed 99. Prove that it is possible to colour the edges of the graph in 2 colours so that the number of edges in any single-coloured directed path in the graph will not exceed 9 .
Dataset text NuminaMath olympiads. 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.