2000 character limit reached
Finite subgraphs of an extension graph (1708.02088v1)
Published 7 Aug 2017 in math.GR and math.GT
Abstract: Let $\Gamma$ be a finite graph and let $\Gamma{\mathrm{e}}$ be its extension graph. We inductively define a sequence ${\Gamma_i}$ of finite induced subgraphs of $\Gamma{\mathrm{e}}$ through successive applications of an operation called "doubling along a star". Then we show that every finite induced subgraph of $\Gamma{\mathrm{e}}$ is isomorphic to an induced subgraph of some $\Gamma_i$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.