On a Quasi-Ramsey problem

It is proved that if a graph G has atleast cn log n vertices, then either G or its complement G contains a subgraph H with atleast n vertices and minimum degree atleast | V(H)|/2. This result is not far from being best possible, as is shown by a rather unusual random construction. Some related questions are also discussed.