The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every $t\in \mathbb{N},$ there exists some constant $c_t$ such that every $K_t$-minor-free graph admits a tree …