A Note on Coloring Line Arrangements

Eyal Ackerman, János Pach, Rom Pinchasi, Radoš Radoičić, Géza Tóth

Abstract


We show that the lines of every arrangement of $n$ lines in the plane can be colored with $O(\sqrt{n/ \log n})$ colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a $\Theta(\sqrt{\log n})$ factor. Any further improvement on this bound would also improve the best known lower bound on the following problem of Erdős: estimate the maximum number of points in general position within a set of $n$ points containing no four collinear points.

Keywords


line arrangement; chromatic number; coloring; hypergraphs

Full Text: PDF