SCHWEITZER 2011 Problem 2
Suppose that the minimum degree δ(G) of a simple graph G with n vertices is at least 3n / 4. Prove that in any 2-coloring of the edges of G , there is a connected subgraph with at least δ(G) +1 points, all edges of which are of the same color.
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.