  An infinite graph is highly connected if the complement of any subgraph of
smaller size is connected. We consider weaker versions of Ramsey's Theorem
asserting that in any coloring of the edges of a complete graph there exist
large highly connected subgraphs all of whose edges are colored by the same
color.
