%A Walczak, Bartosz
%D 2019
%T Coloring triangle-free L-graphs with O(log log n) colors
%K
%X It is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O (log log n ). This improves the previous bound of O (log n ) (McGuinness, 1996) and matches the known lower bound construction (Pawlik et al., 2013).
%U http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1255
%J Acta Mathematica Universitatis Comenianae
%0 Journal Article
%P 1063-1069%V 88
%N 3
%@ 0862-9544
%8 2019-07-31