1. M. Ajtai, P. Erdős, J. Komlós and E. Szemerédi: On Turán’s theorem for sparse graphs, Combinatorica, 1(4) (1981) 313–317.
2. N. Alon: Tools from Higher Algebra, Chapter 32 of Handbooks of Combinatorics (ed. Graham, Lovász, Grötschel), pp. 1749–1783.
3. N. Alon: Eigenvalues and expanders, Combinatorica 6, (1986) 83–96.
4. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. In 40th IEEE Symposium on Foundations of Computer Science, pages 645–655, 1999. MR1917605
5. Alon, N.; Duke, R. A.; Lefmann, H.; Rödl, V.; Yuster, R. The algorithmic aspects of the regularity lemma. Journal of Algorithms, 16(1) (1994) 80–109. Also in: FOCS, 33 (1993) 473–481,