paper

Embedability between right-angled Artin groups

arXiv:1105.5056 · doi:10.2140/gt.2013.17.493

Abstract

In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of $\gam$. We produce a second graph $\gam^e_k$, the clique graph of $\gam^e$, by adding extra vertices for each complete subgraph of $\gam^e$. We prove that each finite induced subgraph of $\gam^e$ gives rise to an inclusion $A(Λ)\to A(\gam)$. Conversely, we show that if there is an inclusion $A(Λ)\to A(\gam)$ then is an induced subgraph of $\gam^e_k$. These results have a number of corollaries. Let denote the path on four vertices and let denote the cycle of length . We prove that embeds in $A(\gam)$ if and only if is an induced subgraph of $\gam$. We prove that if is any finite forest then embeds in . We recover the first author's result on co--contraction of graphs and prove that if $\gam$ has no triangles and $A(\gam)$ contains a copy of for some , then $\gam$ contains a copy of for some . We also recover Kambites' Theorem, which asserts that if embeds in $A(\gam)$ then $\gam$ contains an induced square. Finally, we determine precisely when there is an inclusion and show that there is no "universal" two--dimensional right-angled Artin group.

35 pages. Added an appendix and a proof that the extension graph is quasi-isometric to a tree

References in corpus (6)

Cited by in corpus (47)