On Ramsey (<i>mK</i><sub>2</sub><i>, P</i><sub>4</sub>)-Minimal Graphs
On Ramsey (<i>mK</i><sub>2</sub><i>, P</i><sub>4</sub>)-Minimal Graphs
Let , , and be simple graphs.The notation → (, ) means that any red-blue coloring of all edges of will contain either a red copy of or a blue copy of .Graph is a Ramsey (, )-minimal if → (, ) but for each ∈ (), ( -) ↛ …