KöMaL 2012 A553

Suppose that in a simple graph $G$ with $n$ vertices the minimal degree $\delta$($G$) is at least 3$n$/4. Prove that for any 2-coloring of the edges of $G$, there is a connected subgraph with at least $\delta$($G$)+1 vertices whose edges have the same color.