As usual, for graphs Γ, G, and H, we write Γ → (G,H) to mean that any red-blue colouring of the edges of Γ contains a red copy of G or a blue copy of H. A pair of graphs (G,H) is said to be Ramsey-infinite if there are infinitely many minimal graphs Γ for which we have Γ → (G,H). Let ` ≥ 4 be an integer. We show that if H is a 2connected graph that does not contain induced cycles of length at l...
