Median decompositions arise from any system of vertex cuts via Sageev's dual median graph, are uniquely minimal, satisfy median-width equals clique number on all graphs, and characterize proper geometric actions of groups on median graphs through canonical decompositions of Cayley graphs.
Graphs of someCAT(0)complexes.Adv
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Complete characterization of quasiisometric embeddings between RAAGs on cycle graphs, including exotic cases without subgroup relations and hyperbolic plane embeddings into certain RAAGs.
Branching conditions on RAAG defining graphs force quasiisometric embeddings to induce extension graph embeddings, enabling rigidity theorems including obstructions to tree-product embeddings, classifications for cycle RAAGs, and non-universal receivers in each dimension.
Under geometric branching conditions, quasiisometric embeddings of CAT(0) cube complexes map flats to near-flats, inducing embeddings on Tits boundary graphs.
citing papers explorer
-
Quasiisometric embeddings between right-angled Artin groups: flexibility
Complete characterization of quasiisometric embeddings between RAAGs on cycle graphs, including exotic cases without subgroup relations and hyperbolic plane embeddings into certain RAAGs.
-
Quasiisometric embeddings between right-angled Artin groups: rigidity
Branching conditions on RAAG defining graphs force quasiisometric embeddings to induce extension graph embeddings, enabling rigidity theorems including obstructions to tree-product embeddings, classifications for cycle RAAGs, and non-universal receivers in each dimension.
-
From branching quasiflats to flats in CAT(0) cube complexes
Under geometric branching conditions, quasiisometric embeddings of CAT(0) cube complexes map flats to near-flats, inducing embeddings on Tits boundary graphs.