1 citations · 1 across the 9 of their papers we have counts for
1 paper · 2 filters
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramse…