Coloring triangle-free rectangle overlap graphs with $O(\log \log n)$ colors

Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak

Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\Theta (\log \log n)$. Essentially the same constru…