2022/10/25 by Rutger Campbell, Campbell, Rutger, Marc Distel +13 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2210.13720
openalex publication_date 2022/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A graph class G has linear growth if, for each graph G ∈ 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.