SCHWEITZER 2012 Problem 3
There is a simple graph which chromatic number is equal to . We painted all of the edges of graph using two colors. Prove that there exist a monochromatic tree with vertices
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.