Sintiari and Trotignon's bounded-treewidth conjecture for even-hole-free graphs

For a graph $G=(V(G),E(G))$, a tree decomposition $(T,\chi)$ consists of a tree $T$ and a map $\chi:V(T)\to 2^{V(G)}$ satisfying the usual vertex coverage, edge coverage, and connectedness conditions. The treewidth of $G$, denoted by $\operatorname{tw}(G)$, is the minimum, over all tree decompositions of $G$, of the maximum bag size minus one. A hole is an induced cycle with at least four vertices; it is even if its length is even. A diamond is the unique simple graph with four vertices and five edges. Sintiari and Trotignon's conjecture. For every integer $t$, there exists a constant $c_t$ such that every even-hole-free graph $G$ with no diamond and no clique of size $t$ satisfies

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

The conjecture asserts bounded treewidth for even-hole-free graphs under the stated exclusions, motivated by the existence of even-hole-free graphs of arbitrarily large treewidth when these restrictions are absent. Its resolution status is not specified in the supplied source material.