Coloring intersection graphs of arcwise connected sets in the plane
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak · Scuola Normale Superiore eBooks · 2013
A family of sets in the plane is simple if the intersection of its any subfamily is arcwise connected. We prove that the intersection graphs of simple families of compact arcwise connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.