Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2014 | ELECTRONIC JOURNAL OF COMBINATORICS | Arrangements of lines,chromatic number,sparse hypergraphs |
DocType | Volume | Issue |
Journal | 21 | 2.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
3 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eyal Ackerman | 1 | 188 | 19.80 |
| János Pach | 2 | 2366 | 292.28 |
| Rom Pinchasi | 3 | 209 | 36.14 |
| Rados Radoicic | 4 | 146 | 18.45 |
| Géza Tóth | 5 | 72 | 9.25 |