Bounded tree-independence conjecture for (even hole, diamond)-free graphs

An (even hole, diamond)-free graph is a graph containing neither an even hole nor a diamond as an induced subgraph. Its tree independence number is denoted by $\operatorname{tree-\alpha}(G)$. Bounded tree-independence conjecture. The class of (even hole, diamond)-free graphs has bounded tree independence number. The conjecture would extend the polynomial-time maximum weight independent set result established in the paper to a larger class; the source says that this remains open.