Coloring geometric hyper-graph defined by an arrangement of half-planes
Combinatorics
2011-08-05 v2
Abstract
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
Cite
@article{arxiv.1002.4529,
title = {Coloring geometric hyper-graph defined by an arrangement of half-planes},
author = {Radoslav Fulek},
journal= {arXiv preprint arXiv:1002.4529},
year = {2011}
}