Coloring triangle-free L-graphs with $O(\log\log n)$ colors
Combinatorics
2020-02-26 v1 Computational Geometry
Discrete Mathematics
Abstract
It is proved that triangle-free intersection graphs of L-shapes in the plane have chromatic number . This improves the previous bound of (McGuinness, 1996) and matches the known lower bound construction (Pawlik et al., 2013).
Cite
@article{arxiv.2002.10755,
title = {Coloring triangle-free L-graphs with $O(\log\log n)$ colors},
author = {Bartosz Walczak},
journal= {arXiv preprint arXiv:2002.10755},
year = {2020}
}