Right-angled Artin groups and full subgraphs of graphs
Abstract
For a finite graph , let G() be the right-angled Artin group defined by the complement graph of . We show that, for any linear forest and any finite graph , G() can be embedded into G() if and only if can be realised as a full subgraph of . We also prove that if we drop the assumption that is a linear forest, then the above assertion does not hold, namely, for any finite graph , which is not a linear forest, there exists a finite graph such that G() can be embedded into G(), though cannot be embedded into as a full subgraph.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.