Trotignon's bounded-treewidth conjecture for graphs excluding induced minors
Trotignon's conjecture. For all r,t∈Nr,t\in\mathbb{N}r,t∈N, there exists c=c(r,t)∈Nc=c(r,t)\in\mathbb{N}c=c(r,t)∈N such that for every graph GGG, if GGG does not contain Wt×tW_{t \times t}Wt×t or Kt,tK_{t,t}Kt,t as an…
MathDB