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.
Springer-Verlag, Hei- delberg, 2023, pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces generalisable presentations and topological RAAGs as locally compact groups, studies their Salvetti-type complexes, and constructs TDLC examples of type FP_n but not FP_{n+1}.
citing papers explorer
-
Vertex cuts and median decompositions
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.