2000 character limit reached
Graphs of Linear Growth have Bounded Treewidth
Published 25 Oct 2022 in math.CO | (2210.13720v1)
Abstract: A graph class $\mathcal{G}$ has linear growth if, for each graph $G \in \mathcal{G}$ and every positive integer $r$, every subgraph of $G$ with radius at most $r$ contains $O(r)$ vertices. In this paper, we show that every graph class with linear growth has bounded treewidth.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.