2021/07/14 by Yan Wang, Wang, Yan
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.2107.06583
openalex publication_date 2021/07/14 · openalex created_date 2021/07/19 · openalex updated_date 2026/07/28
In 1984, Thomassen conjectured that for every constant k ∈ ℕ, there exists d such that every graph with average degree at least d contains a balanced subdivision of a complete graph on k vertices, i.e. a subdivision in which each edge is subdivided the same number of times. Recently, Liu and Montgomery confirmed Thomassen's conjecture. We show that for every constant 0