RU-ALLRUSSIAN 1990 Problem 15
A graph has n points and n(n- 1)/2 edges. Each edge is colored with one of k colors so that there are no closed monochrome paths. What is the largest possible value of n (given k)?
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.