On a Quasi-Ramsey problem

  title={On a Quasi-Ramsey problem},
  author={Paul Erd{\"o}s and J{\'a}nos Pach},
  journal={Journal of Graph Theory},
It is proved that if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with at least n vertices and minimum degree at least I V(H) I /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 . 

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-3 of 3 references


R Graham
Rothschild, and J. Spencer, Ramsey Theory. Wiley, New York • 1980
View 1 Excerpt

Some remarks on the theory of graphs

P. Erdős
Bull. Amer. Math. Soc. 53 • 1947
View 1 Excerpt

Similar Papers

Loading similar papers…