Papers
Topics
Authors
Recent
Search
2000 character limit reached

Right-angled Artin groups and full subgraphs of graphs

Published 6 Dec 2016 in math.GR | (1612.01732v1)

Abstract: For a finite graph $\Gamma$, let $G(\Gamma)$ be the right-angled Artin group defined by the complement graph of $\Gamma$. We show that, for any linear forest $\Lambda$ and any finite graph $\Gamma$, $G(\Lambda)$ can be embedded into $G(\Gamma)$ if and only if $\Lambda$ can be realised as a full subgraph of $\Gamma$. We also prove that if we drop the assumption that $\Lambda$ is a linear forest, then the above assertion does not hold, namely, for any finite graph $\Lambda$, which is not a linear forest, there exists a finite graph $\Gamma$ such that $G(\Lambda)$ can be embedded into $G(\Gamma)$, though $\Lambda$ cannot be embedded into $\Gamma$ as a full subgraph.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.