Finite subgraphs of an extension graph
Abstract
Let be a finite graph and let e be its extension graph. We inductively define a sequence \i\ of finite induced subgraphs of e through successive applications of an operation called "doubling along a star". Then we show that every finite induced subgraph of e is isomorphic to an induced subgraph of some i.
0
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.