A. 553. Suppose that in a simple graph G with n vertices the minimal degree (G) is at least 3n/4. Prove that for any 2-coloring of the edges of G, there is a connected subgraph with at least (G)+1 vertices whose edges have the same color.
Deadline expired on 10 February 2012.