Three hundred million points suffice

Joel Spencer

Research output: Contribution to journalArticlepeer-review


There is a graph G with 300,000,000 vertices and no clique on four points, such that if its edges are two colored these must be a monochromatic triangle.

Original languageEnglish (US)
Pages (from-to)210-217
Number of pages8
JournalJournal of Combinatorial Theory, Series A
Issue number2
StatePublished - Nov 1988

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Three hundred million points suffice'. Together they form a unique fingerprint.

Cite this