Coloring triangle-free L-graphs with O(log log n) colors

Bibliographic description

title:	Coloring triangle-free L-graphs with O(log log n) colors
author:	Walczak Bartosz
journal title:	Acta Mathematica Universitatis Comenianae
volume:	88
issue:	3
date of publication :	2019
pages:	1063-1069
ISSN:	0547-0196 0862-9544
eISSN:	1336-0310
URL:	http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1255/763
date accessed:	2019-12-04
language:	English
journal language:	English
abstract in English:	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).
affiliation:	Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
type:	journal article
subtype:	academic paper

Files	Size	Format	View
There are no files associated with this item.