Erdős's exponential conjecture for induced Ramsey numbers

Let $H$ be a graph with $k$ vertices, and let $R^{\mathrm{ind}}(H)$ denote the minimum number of vertices of a graph $G$ such that every red-blue edge-colouring of $G$ contains an induced monochromatic copy of $H$. Erdős's conjecture. There exists a constant $C>0$ such that

$$R^{\mathrm{ind}}(H)\leqslant 2^{Ck}$$

for every graph $H$ with $k$ vertices. This conjecture predicts an exponential upper bound for induced Ramsey numbers; it was recently proved by Aragão, Campos, Dahia, Filipe and Marciano.