Paul Erdős, Peter Frankl, Vojtěch Rödl. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent // Graphs and Combinatorics. — 1986. — Т. 2, вип. 2. — С. 113–121. — doi:10.1007/BF01788085.
Noga Alon, Asaf Shapira. Testing subgraphs in directed graphs // Journal of Computer and System Sciences. — 2004. — Т. 69, вип. 3. — С. 353–382. — doi:10.1016/j.jcss.2004.04.008.
Terence Tao. A variant of the hypergraph removal lemma // Journal of Combinatorial Theory. — 2006. — Т. 113, вип. 7. — С. 1257–1280. — doi:10.1016/j.jcta.2005.11.006.