On Ramsey (mK₂,H)-minimal graphs
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)\).
- On Ramsey (2K₂, 2H)-minimal graphs
- On Ramsey \((2K_2, 2 P_n )\)-minimal graphs
- On Ramsey \((K_{1,2}, K_n)\)-minimal graphs
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs
- On Ramsey (2K₂,K₄)-minimal graphs
- On Ramsey \((4K_2,P_3)\)-minimal graphs
- On Ramsey minimal graphs
- On Ramsey minimal graphs
- On Ramsey Minimal Graphs
- Ramsey minimal graphs for 2K₂ versus P_n
- scientific article; zbMATH DE number 3672341 (Why is no real title available?)
- scientific article; zbMATH DE number 3735863 (Why is no real title available?)
- scientific article; zbMATH DE number 3458663 (Why is no real title available?)
- scientific article; zbMATH DE number 2124082 (Why is no real title available?)
- Matching-star Ramsey sets
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs
- On Ramsey (2K₂,K₄)-minimal graphs
- On Ramsey (3K₂,P₃)-minimal graphs
- On Ramsey \((K_{1,2,}C_4)\)-minimal graphs
- On Ramsey \((K_{1,2},P_4)\)-minimal graphs
- On Ramsey \((mK_2,H)\)-minimal graphs
- On Ramsey minimal graphs
- On Ramsey minimal graphs
- On Ramsey numbers for trees versus wheels of five or six vertices
- Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
- Ramsey \((K_{1,2}, C_4)\)-minimal graphs
- Ramsey minimal graphs for 2K₂ versus P_n
- Ramsey-minimal graphs for forests
- The Complete List of Ramsey (2K2,K4)-Minimal Graphs
- The Ramsey number for a cycle of length five vs. a complete graph of order six
- Minimal vertex Ramsey graphs and minimal forbidden subgraphs
- On Ramsey \((mK_2,H)\)-minimal graphs
- scientific article; zbMATH DE number 7535270 (Why is no real title available?)
- On Ramsey \((2K_2, 2 P_n )\)-minimal graphs
- On Ramsey (3K₂,P₃)-minimal graphs
- On Ramsey (2K₂, 2H)-minimal graphs
- Some open problems of Ramsey minimal graphs
- On Ramsey minimal graphs
- On Ramsey (2K₂, W_n)-minimal graphs of smallest order
This page was built for publication: On Ramsey \((mK_2,H)\)-minimal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361089)
