2 problems

Polylogarithmic tree-independence conjecture. For every positive integer $t$, there is an integer $d=d(t)$ such that for every $n\ge2$, every $n$-vertex graph with no induced minor…

Gartland's conjecture. For every positive integer $t$, there is an integer $d=d(t)$ such that every $\mathcal{L}_t$-free graph $G$ with no induced subgraph isomorphic to a subdivis…