Papers
Topics
Authors
Recent
Search
2000 character limit reached

Finite subgraphs of an extension graph

Published 7 Aug 2017 in math.GR and math.GT | (1708.02088v1)

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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Collections

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