On embeddings of CAT(0) cube complexes into products of trees
arXiv:1107.0863 · doi:10.1016/j.jctb.2013.04.003
Abstract
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.
arXiv commentPrevious 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
References in corpus (2)
Cited by in corpus (10)
- Hierarchically hyperbolic spaces I: curve complexes for cubical groups
- Weakly modular graphs and nonpositive curvature
- The simplicial boundary of a CAT(0) cube complex
- 1-Safe Petri nets and special cube complexes: equivalence and applications
- Hyperbolic groups with almost finitely presented subgroups
- Lower bounds on cubical dimension of groups
- A counterexample to Thiagarajan's conjecture on regular event structures
- A new construction of CAT(0) cube complexes
- Sample compression schemes for balls in graphs
- Radial Schur multipliers on some generalisations of trees