加载中…
We prove that the contact graph of a 2-dimensional CAT(0) cube complex of maximum degree can be coloured with at most colours, for a fixed constant . This implies that (and the associated median graph) isometrically embeds in the Cartesian product of at most trees, and that the event structure whose domain is admits a nice labeling with labels. On the other hand, we present an example of a 5-dimensional CAT(0) cube complex with uniformly bounded degrees of 0-cubes which cannot be embedded into a Cartesian product of a finite number of trees. This answers in the negative a question raised independently by F. Haglund, G. Niblo, M. Sageev, and the first author of this paper.

生成讲解博客的中文版本

生成AI智能校验的中文版本