Small subsets inherit sparse ?-regularity. submitted, 2004. ,
A probabilistic counting lemma for complete graphs. submitted, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-01184453
K 4-free subgraphs of random graphs revisited, Combinatorica, vol.23, issue.3, 2002. ,
DOI : 10.1007/s00493-007-2010-5
K5-free subgraphs of random graphs, Random Structures and Algorithms, vol.260, issue.2, pp.194-232, 2004. ,
DOI : 10.1002/rsa.20000
The sparse regularity lemma and its applications, 20th British Combinatorial Conference, 2005. ,
DOI : 10.1017/CBO9780511734885.010
Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000. ,
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
OnK 4-free subgraphs of random graphs, Combinatorica, vol.8, issue.2, pp.173-213, 1997. ,
DOI : 10.1007/BF01200906
Regular pairs in sparse random graphs. I. Random Structures & Algorithms, pp.359-434, 2003. ,
The Turn Theorem for Random Graphs, Combinatorics, Probability and Computing, vol.13, issue.1, pp.61-91, 2004. ,
DOI : 10.1017/S0963548303005856
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
Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, pp.295-352, 1993. ,
On triangle-free random graphs. Random Structures & Algorithms, pp.260-276, 2000. ,
Tur??n's theorem in sparse random graphs, Random Structures & Algorithms, vol.48, issue.1, pp.225-234, 2003. ,
DOI : 10.1002/rsa.10088
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. ,