A. F. Sidorenko The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:185-196 [Journal]
A. F. Sidorenko Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1991, v:2, n:1, pp:73-100 [Journal]