Sintiari–Trotignon conjecture on treewidth of diamond-free even-hole-free graphs

For a graph $G$, let $\operatorname{tw}(G)$ denote its treewidth. A graph is even-hole-free if it has no induced cycle of even length at least four, and the diamond is the graph on four vertices with five edges. Sintiari–Trotignon's conjecture. For every integer $t\geq 1$, there exists a constant $c_t$ such that every even-hole-free graph $G$ with no induced diamond and no clique of size $t$ satisfies

$$\operatorname{tw}(G)\leq c_t.$$

This conjecture was resolved in the cited work TWXI, so the asserted bounded-treewidth conclusion is now a theorem.