S. Gerke, Y. Kohayakawa, V. Rödl, and A. Steger, Small subsets inherit sparse ?-regularity. submitted, 2004.

S. Gerke, M. Marciniszyn, and A. Steger, A probabilistic counting lemma for complete graphs. submitted, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184453

S. Gerke, H. J. Prömel, T. Schickinger, A. Steger, and A. Taraz, K 4-free subgraphs of random graphs revisited, Combinatorica, vol.23, issue.3, 2002.
DOI : 10.1007/s00493-007-2010-5

S. Gerke, T. Schickinger, and A. Steger, K5-free subgraphs of random graphs, Random Structures and Algorithms, vol.260, issue.2, pp.194-232, 2004.
DOI : 10.1002/rsa.20000

S. Gerke and A. Steger, The sparse regularity lemma and its applications, 20th British Combinatorial Conference, 2005.
DOI : 10.1017/CBO9780511734885.010

S. Janson, T. ?uczak, and A. Rucinski, Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000.

Y. Kohayakawa, Szemer??di???s Regularity Lemma for Sparse Graphs, Foundations of computational mathematics, pp.216-230, 1997.
DOI : 10.1007/978-3-642-60539-0_16

Y. Kohayakawa, T. ?uczak, and V. , OnK 4-free subgraphs of random graphs, Combinatorica, vol.8, issue.2, pp.173-213, 1997.
DOI : 10.1007/BF01200906

Y. Kohayakawa and V. , Regular pairs in sparse random graphs. I. Random Structures & Algorithms, pp.359-434, 2003.

Y. Kohayakawa, V. Rödl, and M. Schacht, The Turn Theorem for Random Graphs, Combinatorics, Probability and Computing, vol.13, issue.1, pp.61-91, 2004.
DOI : 10.1017/S0963548303005856

J. Komlós, A. Shokoufandeh, M. Simonovits, and E. Szemerédi, The Regularity Lemma and Its Applications in Graph Theory, Theoretical aspects of computer science, pp.84-112, 2002.
DOI : 10.1007/3-540-45878-6_3

J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, pp.295-352, 1993.

T. ?uczak, On triangle-free random graphs. Random Structures & Algorithms, pp.260-276, 2000.

T. Szabó and V. H. Vu, Tur??n's theorem in sparse random graphs, Random Structures & Algorithms, vol.48, issue.1, pp.225-234, 2003.
DOI : 10.1002/rsa.10088

E. Szemerédi, Regular partitions of graphs InProbì emes combinatoires et théorie des graphes (Colloq, Internat. CNRS, Univ. Orsay, Orsay Colloq. Internat. CNRS CNRS, vol.260, pp.399-401, 1976.