Follow
Tom Bohman
Tom Bohman
Verified email at math.cmu.edu
Title
Cited by
Cited by
Year
The early evolution of the H-free process
T Bohman, P Keevash
Inventiones mathematicae 181 (2), 291-336, 2010
1672010
The triangle-free process
T Bohman
Advances in Mathematics 221 (5), 1653-1677, 2009
1532009
Avoiding a giant component
T Bohman, A Frieze
Random Structures & Algorithms 19 (1), 75-85, 2001
1272001
On the irregularity strength of trees
T Bohman, D Kravitz
Journal of graph theory 45 (4), 241-254, 2004
1222004
How many random edges make a dense graph Hamiltonian?
T Bohman, A Frieze, R Martin
Random Structures & Algorithms 22 (1), 33-42, 2003
872003
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
862004
Dynamic concentration of the triangle-free process
T Bohman, P Keevash
The Seventh European Conference on Combinatorics, Graph Theory and …, 2013
822013
Creating a giant component
T Bohman, D Kravitz
Combinatorics, Probability and Computing 15 (4), 489-511, 2006
632006
Six lonely runners
T Bohman, R Holzman, D Kleitman
the electronic journal of combinatorics, R3-R3, 2001
562001
Adding random edges to dense graphs
T Bohman, A Frieze, M Krivelevich, R Martin
Random Structures & Algorithms 24 (2), 105-117, 2004
492004
Random triangle removal
T Bohman, A Frieze, E Lubetzky
Advances in Mathematics 280, 379-438, 2015
462015
Hamilton cycles in 3‐out
T Bohman, A Frieze
Random Structures & Algorithms 35 (4), 393-417, 2009
462009
Erdős–Ko–Rado in random hypergraphs
J Balogh, T Bohman, D Mubayi
Combinatorics, Probability and Computing 18 (5), 629-646, 2009
402009
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
381996
SIR epidemics on random graphs with a fixed degree sequence
T Bohman, M Picollelli
Random Structures & Algorithms 41 (2), 179-214, 2012
342012
Min-wise independent linear permutations
T Bohman, C Cooper, A Frieze
the electronic journal of combinatorics 7 (1), R26, 2000
342000
The game chromatic number of random graphs
T Bohman, A Frieze, B Sudakov
Random Structures & Algorithms 32 (2), 223-235, 2008
322008
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
322003
Karp–Sipser on random graphs with a fixed degree sequence
T Bohman, A Frieze
Combinatorics, Probability and Computing 20 (5), 721-741, 2011
312011
Large girth approximate Steiner triple systems
T Bohman, L Warnke
Journal of the London Mathematical Society 100 (3), 895-913, 2019
302019
The system can't perform the operation now. Try again later.
Articles 1–20