Geometric triangle-free graphs of large chromatic number

We present several geometric constructions of triangle-free and large girth families of graphs with rapidly growing chromatic numbers. 1. We construct a triangle-free intersection graph of $n$ boxes in $\mathbb{R}^3$ with independence number $n(\log n)^{-1+o(1)}$, and thus chromatic number $(\log