Let n,s, and t be positive integers and 0<λ<1. A simple graph on n vertices with at least λn2 edges is given. We say that (x1,…,xs,y1,…,yt) is a good intersection if letters xi and yj denote not necessarily distinct vertices and every xiyj is an edge of the graph (1≤i≤s, 1≤j≤t). Prove that the number of good insertions is at least λstns+t.Proposed by Kada Williams, Cambridge graph theorykomalcombinatorics