MathDB
ASU 525 All Soviet Union MO 1990 graph, n points, n(n-1)/2 edges, coloring

Source:

August 14, 2019
graphColoringcombinatorics

Problem Statement

A graph has nn points and n(n−1)2\frac{n(n-1)}{2} edges. Each edge is colored with one of kk colors so that there are no closed monochrome paths. What is the largest possible value of nn (given kk)?
Back to ProblemsView on AoPS