Triangle embedding lemma for regular pairs
= Triangle embedding lemma for regular pairs
If the three pairs among vertex sets $A,B,C$ are $\varepsilon$-regular and each has density at least $2\varepsilon$, where $0<\varepsilon<1/2$, then the graph contains a triangle with one vertex in each set.