Coloring n-sets red and blue

Joel Spencer

Research output: Contribution to journalArticlepeer-review


A short proof is given of the following result of J. Beck. Given any m = 2nn 1 3+o(1) sets of cardinality n, there exists a 2-coloring of the underlying points so that no set is monochromatic.

Original languageEnglish (US)
Pages (from-to)112-113
Number of pages2
JournalJournal of Combinatorial Theory, Series A
Issue number1
StatePublished - Jan 1981

ASJC Scopus subject areas

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


Dive into the research topics of 'Coloring n-sets red and blue'. Together they form a unique fingerprint.

Cite this