Coloring axis-parallel rectangles

For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r = 2, this answers a question of S.. Smorodinsky [S. Smorodinsky, On the chromatic number of some geometric hypergraphs, SIAM J. Discrete Math. 21 (2007) 676-687]. (C) 2009 Elsevier Inc. All rights reserved.


Published in:
Journal of Combinatorial Theory.Series A, 117, 6, 776-782
Year:
2010
Keywords:
Laboratories:




 Record created 2010-11-26, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)