A note on coloring line arrangements

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


Published in:
Electronic Journal Of Combinatorics, 21, 2
Year:
2014
Publisher:
Newark, Electronic Journal Of Combinatorics
ISSN:
1077-8926
Keywords:
Laboratories:




 Record created 2014-06-16, last modified 2018-03-17


Rate this document:

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