1. The Probabilistic Method
2. Increasing the chromatic number of a random graph;Alon;J Comb,2010
3. Local resilience of almost spanning trees in random graphs;Balogh;Rand Struct Alg,2011
4. Corrádi and Hajnal's theorem for sparse random graphs;Balogh;Comb Probab Comput (in press), DOI: 10.1017/S0963548311000642
5. Long cycles in subgraphs of (pseudo)random directed graphs;Ben-Eliezer;J Graph Theory (in press), DOI: 10.1002/jgt.20616