论文标题
用$ o（\ log \ log n）$颜色着色三角形的l-graphs $
Coloring triangle-free L-graphs with $O(\log\log n)$ colors
论文作者
论文摘要
事实证明，飞机中$ n $ l形的三角形交叉图具有色度$ o（\ log \ log n）$。这改善了$ O（\ log n）$（McGuinness，1996）的先前界限，并与已知的下限结构相匹配（Pawlik等，2013）。
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).
