Alon N., Krivelevich M. and Sudakov B. (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 73–82.
Bohman T. (2009) The triangle-free process. Adv. Math. 221 1653–1677.
Bohman T. and Keevash P. (2010) The early evolution of the H-free process. Invent. Math. 181 291–336.
Bollobás B. (2001) Random Graphs, second edition, Cambridge University Press.
Bollobás B. and Riordan O. (2000) Constrained graph processes. Electron. J. Combin. 7 #R18.
Erdős P., Suen S. and Winkler P. (1995) On the size of a random maximal graph. Random Struct. Alg. 6 309–318.
Gerke S. and Makai T. (2010) No dense subgraphs appear in the triangle-free graph process. Manuscript. arXiv:1002.2316
Kim J. H. (1995) The Ramsey number R(3, t) has order of magnitude t 2/logt. Random Struct. Alg. 7 173–207.
Osthus D. and Taraz A. (2001) Random maximal H-free graphs. Random Struct. Alg. 18 61–82.
Picollelli M. (2010) The diamond-free process. Manuscript. arXiv:1010.5207
Ruciński A. and Wormald N. (1992) Random graph processes with degree restrictions. Combin. Probab. Comput. 1 169–180.
Spencer J. (1990) Counting extensions. J. Combin. Theory Ser. A 55 247–255.
Warnke L. Dense subgraphs in the H-free process. Discrete Math., to appear. arXiv:1003.0220
Warnke L. (2010) When does the K 4-free process stop? Manuscript. arXiv:1007.3037
Wolfovitz G. (2009) Lower bounds for the size of maximal H-free graphs. Electron. J. Combin. 16 #R4.
Wolfovitz G. (2010) The K 4-free process. Manuscript. arXiv:1008.4044
Wolfovitz G. Triangle-free subgraphs in the triangle-free process. Random Struct. Alg., to appear. arXiv:0903.1756
Wormald N. (1999) The differential equation method for random graph processes and greedy algorithms. In Lectures on Approximation and Randomized Algorithms (Karonski M. and Prömel H. J., eds), pp. 73–155, PWN, Warsaw.