Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 27 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 227 tok/s Pro
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$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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