Loading...
research article
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.
Loading...
Name
ojs-index-php-eljc-article-download-v21i2p23.pdf
Type
Publisher's version
Access type
openaccess
License Condition
CC BY
Size
239.34 KB
Format
Adobe PDF
Checksum (MD5)
5e9837f2cf8aa0b7d43261845fb22737