Thresholds for constrained Ramsey and anti-Ramsey problems

Natalie Behague, Robert Hancock, Joseph Hyde +2

Let $H_1$ and $H_2$ be graphs. A graph $G$ has the constrained Ramsey property for $(H_1,H_2)$ if every edge-colouring of $G$ contains either a monochromatic copy of $H_1$ or a rai…