|
|||||
|
|
Coloring axis-parallel rectangles |
|
| Authors: | Já nos Pach,Gá bor Tardos |
| Affiliation: | a City College and Courant Institute, New York, NY, United States b EPFL, Lausanne, Switzerland c Department of Computer Science, Simon Fraser University, Burnaby, Canada |
| Abstract: | 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]. |
| Keywords: | Coloring Hypergraph Chromatic number |
| 本文献已被 ScienceDirect 等数据库收录！ | |