Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 112-113 |
Number of pages | 2 |
Journal | Journal of Combinatorial Theory, Series A |
Volume | 30 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1981 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics