| The early evolution of the H-free process T Bohman, P Keevash Inventiones mathematicae 181 (2), 291-336, 2010 | 180 | 2010 |
| The triangle-free process T Bohman Advances in Mathematics 221 (5), 1653-1677, 2009 | 166 | 2009 |
| Avoiding a giant component T Bohman, A Frieze Random Structures & Algorithms 19 (1), 75-85, 2001 | 132 | 2001 |
| On the irregularity strength of trees T Bohman, D Kravitz Journal of graph theory 45 (4), 241-254, 2004 | 131 | 2004 |
| How many random edges make a dense graph Hamiltonian? T Bohman, A Frieze, R Martin Random Structures & Algorithms 22 (1), 33-42, 2003 | 107 | 2003 |
| Avoidance of a giant component in half the edge set of a random graph T Bohman, A Frieze, NC Wormald Random Structures & Algorithms 25 (4), 432-449, 2004 | 86 | 2004 |
| Dynamic concentration of the triangle-free process T Bohman, P Keevash The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | 81 | 2013 |
| Six lonely runners T Bohman, R Holzman, D Kleitman the electronic journal of combinatorics, R3-R3, 2001 | 66 | 2001 |
| Creating a giant component T Bohman, D Kravitz Combinatorics, Probability and Computing 15 (4), 489-511, 2006 | 62 | 2006 |
| Hamilton cycles in 3‐out T Bohman, A Frieze Random Structures & Algorithms 35 (4), 393-417, 2009 | 56 | 2009 |
| Adding random edges to dense graphs T Bohman, A Frieze, M Krivelevich, R Martin Random Structures & Algorithms 24 (2), 105-117, 2004 | 55 | 2004 |
| Random triangle removal T Bohman, A Frieze, E Lubetzky Advances in Mathematics 280, 379-438, 2015 | 54 | 2015 |
| Erdős–Ko–Rado in random hypergraphs J Balogh, T Bohman, D Mubayi Combinatorics, Probability and Computing 18 (5), 629-646, 2009 | 42 | 2009 |
| The game chromatic number of random graphs T Bohman, A Frieze, B Sudakov Random Structures & Algorithms 32 (2), 223-235, 2008 | 40 | 2008 |
| A sum packing problem of Erdös and the Conway-Guy sequence T Bohman Proceedings of the American Mathematical Society 124 (12), 3627-3636, 1996 | 39 | 1996 |
| SIR epidemics on random graphs with a fixed degree sequence T Bohman, M Picollelli Random Structures & Algorithms 41 (2), 179-214, 2012 | 37 | 2012 |
| A nontrivial lower bound on the Shannon capacities of the complements of odd cycles T Bohman, R Holzman IEEE Transactions on Information Theory 49 (3), 721-722, 2003 | 37 | 2003 |
| Min-wise independent linear permutations T Bohman, C Cooper, A Frieze the electronic journal of combinatorics 7 (1), R26, 2000 | 36 | 2000 |
| Large girth approximate Steiner triple systems T Bohman, L Warnke Journal of the London Mathematical Society 100 (3), 895-913, 2019 | 35 | 2019 |
| Karp–Sipser on random graphs with a fixed degree sequence T Bohman, A Frieze Combinatorics, Probability and Computing 20 (5), 721-741, 2011 | 33 | 2011 |
Alan FriezeCarnegie Mellon UniversityAdresse e-mail validée de random.math.cmu.edu
