On Ramsey \((mK_2,H)\)-minimal graphs (Q2361089)

Given graphs \(F\), \(G\), \(H\), we write \(F\rightarrow(G,H)\) if whenever we colour the edges of \(F\) with the colours red and blue then we either get a red copy of \(G\) or a blue copy of \(H\). We also write \(\mathcal{R}(G,H)\) for the set of all graphs \(F\) such that \(F\rightarrow(G,H)\) but if \(F^\prime\) is obtained from \(F\) by removing any single edge, then \(F^\prime\nrightarrow(G,H)\). The current paper gives a characterisation of \(\mathcal{R}(mK_2,H)\). The characterisation is rather hard to use. Two more specific related results are also obtained. The first one is a simpler characterisation of the disconnected graphs in \(\mathcal{R}(mK_2,H)\) for the case of a connected graph \(H\). The second one is a sufficient condition for a graph to belong in \(\mathcal{R}((m+1)K_2,P_3)\) based on knowledge of \(\mathcal{R}(mK_2,P_3)\).