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 - 1981 |
Fingerprint
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science
Cite this
Coloring n-sets red and blue. / Spencer, Joel.
In: Journal of Combinatorial Theory, Series A, Vol. 30, No. 1, 1981, p. 112-113.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Coloring n-sets red and blue
AU - Spencer, Joel
PY - 1981
Y1 - 1981
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0012636967&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0012636967&partnerID=8YFLogxK
U2 - 10.1016/0097-3165(81)90045-5
DO - 10.1016/0097-3165(81)90045-5
M3 - Article
VL - 30
SP - 112
EP - 113
JO - Journal of Combinatorial Theory - Series A
JF - Journal of Combinatorial Theory - Series A
SN - 0097-3165
IS - 1
ER -