Ramsey-type problems for tilings in dense graphs

József Balogh, Andrea Freschi, Andrew Treglown

Given a graph $H$, the Ramsey number $R(H)$ is the smallest positive integer $n$ such that every $2$-edge-colouring of $K_n$ yields a monochromatic copy of $H$. We write $mH$ to de…