SCHWEITZER 2006 Problem 3
G is a complete geometric graph such that for any 4-coloring of its edges, we can find n edges which are pairwise disjoint and have the same color. Prove that the minimum number of vertices of G is 6n-4.
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.