2023/02/23 by Blanco, Pablo, Cook, Linda, Hatzel, Meike +3
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2302.12106
In 2019, Dvořák asked whether every connected graph G has a tree decomposition (T, B) so that T is a subgraph of G and the width of (T, B) is bounded by a function of the treewidth of G. We prove that this is false, even when G has treewidth 2 and T is allowed to be a minor of G.