Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
