An exponential upper bound for induced Ramsey numbers

Lucas Aragão, Marcelo Campos, Gabriel Dahia +2

The induced Ramsey number $R_{\mathrm{ind}}(H;r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edg…