Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5970276)

Summary: A classic result of \textit{E. Asplund} and \textit{B. Grünbaum} [Math. Scand. 8, 181--188 (1960; Zbl 0095.17002)] states that intersection graphs of axis-aligned rectangles in the plane are \(\chi\)-bounded. This theorem can be equivalently stated in terms of path-decompositions as follows: There exists a function \(f:\mathbb{N}\rightarrow\mathbb{N}\) such that every graph that has two path-decompositions such that each bag of the first decomposition intersects each bag of the second in at most \(k\) vertices has chromatic number at most \(f(k)\). Recently, \textit{V. Dujmović} et al. [``Orthogonal tree decompositions of graph'', Preprint, \url{arXiv:1701.05639}] asked whether this remains true more generally for two tree-decompositions. In this note we provide a negative answer: There are graphs with arbitrarily large chromatic number for which one can find two tree-decompositions such that each bag of the first decomposition intersects each bag of the second in at most two vertices. Furthermore, this remains true even if one of the two decompositions is restricted to be a path-decomposition. This is shown using a construction of triangle-free graphs with unbounded chromatic number due to \textit{J. P. Burling} [On coloring problems of families of prototypes. University of Colorado, Boulder (PhD Thesis) (1965)], which we believe should be more widely known.