Name
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]. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jcta.2009.04.007 | Journal of Combinatorial Theory |
Keywords | DocType | Volume |
coloring,chromatic number,hypergraph,plane | Journal | 117 |
Issue | ISSN | Citations |
6 | Journal of Combinatorial Theory, Series A | 7 |
PageRank | References | Authors |
0.73 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| János Pach | 1 | 2366 | 292.28 |
| Gábor Tardos | 2 | 1261 | 140.58 |