For any graphs 𝐹 ,𝐺, and 𝐻, the notation 𝐹 → (𝐺,𝐻) means that any red-blue coloring of all edges of 𝐹 will contain either a red copy of 𝐺 or a blue copy of 𝐻. The set (𝐺,𝐻) consists of all Ramsey (𝐺,𝐻)-minimal ...