On embeddings of CAT(0) cube complexes into products of trees

Victor Chepoi; Mark F. Hagen

doi:10.1016/j.jctb.2013.04.003

On embeddings of CAT(0) cube complexes into products of trees

Metric Geometry 2026-04-23 v4 Combinatorics

Authors: Victor Chepoi , Mark F. Hagen

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We prove that the contact graph of a 2-dimensional CAT(0) cube complex ${\bf X}$ of maximum degree $\Delta$ can be coloured with at most $\epsilon(\Delta)=M\Delta^{26}$ colours, for a fixed constant $M$ . This implies that ${\bf X}$ (and the associated median graph) isometrically embeds in the Cartesian product of at most $\epsilon(\Delta)$ trees, and that the event structure whose domain is ${\bf X}$ admits a nice labeling with $\epsilon(\Delta)$ 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.

Keywords

CAT(0) cube complex contact graph embedding into product of trees median graph event structure graph coloring

Cite

@article{arxiv.1107.0863,
  title  = {On embeddings of CAT(0) cube complexes into products of trees},
  author = {Victor Chepoi and Mark F. Hagen},
  journal= {arXiv preprint arXiv:1107.0863},
  year   = {2026}
}

Comments

Previous version had an error in Lemma 12, affecting Theorem 1. Current version has appendix correcting Theorem 1 under additional hypothesis: no vertex has a 5-cycle in its link or, equivalently, the crossing graph has no 5-cycle. (4-cycles, and cycles larger than 5, are allowed.) Theorem 2, is unchanged. Appendix appears as journal correction: https://doi.org/10.1016/j.jctb.2026.04.001

On embeddings of CAT(0) cube complexes into products of trees

Abstract

Keywords

Cite

Comments

Related papers