On induced Ramsey numbers for multiple copies of graphs

Maria Axenovich, Izolda Gorgol

We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F…