Disconnected Common Graphs via Supersaturation

Jae-baek Lee, Jonathan A. Noel

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a ra…