1 citations · 1 across the 1 of their papers we have counts for
1 paper
Robert Hancock, Daniel Kral, Matjaz Krnc +1
A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of…