Cloning and unfolding, two new graph operations that preserve quasi-isometry type, plus new geometric obstructions, give a complete decision procedure for RAAGediness of triangle-free CFS graphs with at most 10 vertices.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
RAAGedy right-angled Coxeter groups
Cloning and unfolding, two new graph operations that preserve quasi-isometry type, plus new geometric obstructions, give a complete decision procedure for RAAGediness of triangle-free CFS graphs with at most 10 vertices.