Tom Bohman

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 11

Top Topics

Computational Effort

Independent Set

Top Venues

Random Struct. Algorithms

J. Graph Theory

Comb. Probab. Comput.

Electron. J. Comb.

Publications

Tom Bohman, Jakob Hofstad
A critical probability for biclique partition of G,. J. Comb. Theory B 166 (2024)
Tom Bohman, Fei Peng
A Construction for Boolean Cube Ramsey Numbers. Order 40 (2) (2023)
Tom Bohman, Emily Zhu
On Multicolor Ramsey Numbers of Triple System Paths of Length 3. SIAM J. Discret. Math. 37 (3) (2023)
Tom Bohman, Xizhi Liu, Dhruv Mubayi
Independent sets in hypergraphs omitting an intersection. Random Struct. Algorithms 61 (3) (2022)
Tom Bohman, Peter Keevash
Dynamic concentration of the triangle-free process. Random Struct. Algorithms 58 (2) (2021)
Tom Bohman, Dhruv Mubayi
Independence Number of Graphs with a Prescribed Number of Cliques. Electron. J. Comb. 26 (2) (2019)
Tom Bohman, Lutz Warnke
Large girth approximate Steiner triple systems. J. Lond. Math. Soc. 100 (3) (2019)
Patrick Bennett, Tom Bohman
A natural barrier in random greedy hypergraph matching. Comb. Probab. Comput. 28 (6) (2019)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph. J. Graph Theory 88 (3) (2018)
Noga Alon, Tom Bohman, Hao Huang
More on the Bipartite Decomposition of Random Graphs. J. Graph Theory 84 (1) (2017)
Patrick Bennett, Tom Bohman
A note on the random greedy independent set algorithm. Random Struct. Algorithms 49 (3) (2016)
Tom Bohman, Ron Holzman, Venkatesh Natarajan
On the Independence Numbers of the Cubes of Odd Cycles. Electron. J. Comb. 20 (3) (2013)
József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao
. SIAM J. Discret. Math. 26 (4) (2012)
Tom Bohman, Michael Picollelli
SIR epidemics on random graphs with a fixed degree sequence. Random Struct. Algorithms 41 (2) (2012)
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
A greedy algorithm for finding a large 2-matching on a random cubic graph CoRR (2012)
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov
Ramsey games with giants. Random Struct. Algorithms 38 (1-2) (2011)
Tom Bohman, Alan M. Frieze
Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 20 (5) (2011)
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
Random greedy triangle-packing beyond the 7/4 barrier CoRR (2011)
Tom Bohman, Alan M. Frieze, Dhruv Mubayi
Coloring H-free hypergraphs. Random Struct. Algorithms 36 (1) (2010)
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
A note on the random greedy triangle-packing algorithm CoRR (2010)
Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko
Hypergraphs with independent neighborhoods. Comb. 30 (3) (2010)
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth
Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100 (3) (2010)
Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko
Flips in Graphs. SIAM J. Discret. Math. 24 (3) (2010)
Tom Bohman, Ron Holzman, Venkatesh Natarajan
Maximum Independent Sets in Certain Powers of Odd Cycles. Electron. J. Comb. 16 (1) (2009)
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
Memoryless Rules for Achlioptas Processes. SIAM J. Discret. Math. 23 (2) (2009)
Tom Bohman, Alan M. Frieze
Hamilton cycles in 3-out. Random Struct. Algorithms 35 (4) (2009)
József Balogh, Tom Bohman, Dhruv Mubayi
Erdos-Ko-Rado in Random Hypergraphs. Comb. Probab. Comput. 18 (5) (2009)
Tom Bohman, Alan M. Frieze, Benny Sudakov
The game chromatic number of random graphs. Random Struct. Algorithms 32 (2) (2008)
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407 (1-3) (2008)
Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Clifford D. Smyth
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30 (1-2) (2007)
Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky
First-Order Definability of Trees and Sparse Random Graphs. Comb. Probab. Comput. 16 (3) (2007)
Tom Bohman, Jeong Han Kim
A phase transition for avoiding a giant component. Random Struct. Algorithms 28 (2) (2006)
Tom Bohman, David Kravitz
Creating a Giant Component. Comb. Probab. Comput. 15 (4) (2006)
Tom Bohman, David Kravitz
On the irregularity strength of trees. J. Graph Theory 45 (4) (2004)
Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25 (4) (2004)
Tom Bohman, Ron Holzman
Linear Versus Hereditary Discrepancy. Comb. 25 (1) (2004)
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
Adding random edges to dense graphs. Random Struct. Algorithms 24 (2) (2004)
Tom Bohman, Alan M. Frieze
Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32 (2) (2003)
Tom Bohman, Ryan R. Martin
A note on G-intersecting families. Discret. Math. 260 (1-3) (2003)
Tom Bohman, Alan M. Frieze, Ryan R. Martin
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22 (1) (2003)
Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003)
Tom Bohman, Ron Holzman
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. IEEE Trans. Inf. Theory 49 (3) (2003)
Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
On partitions of discrete boxes. Discret. Math. 257 (2-3) (2002)
Tom Bohman, Ron Holzman
On a list coloring conjecture of Reed. J. Graph Theory 41 (2) (2002)
Tom Bohman, Alan M. Frieze
Addendum to avoiding a giant component. Random Struct. Algorithms 20 (1) (2002)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
G-Intersecting Families. Comb. Probab. Comput. 10 (5) (2001)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
Vertex Covers by Edge Disjoint Cliques. Comb. 21 (2) (2001)
Tom Bohman, Alan M. Frieze
Arc-Disjoint Paths in Expander Digraphs. FOCS (2001)
Tom Bohman, Alan M. Frieze
Avoiding a giant component. Random Struct. Algorithms 19 (1) (2001)
Tom Bohman, Ron Holzman, Daniel J. Kleitman
Six Lonely Runners. Electron. J. Comb. 8 (2) (2001)
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
Note on Sparse Random Graphs and Cover Graphs. Electron. J. Comb. 7 (2000)
Tom Bohman, Colin Cooper, Alan M. Frieze
Min-Wise Independent Linear Permutations. Electron. J. Comb. 7 (2000)
Tom Bohman, Janko Gravner
Random threshold growth dynamics. Random Struct. Algorithms 15 (1) (1999)
Tom Bohman
A Construction for Sets of Integers with Distinct Subset Sums. Electron. J. Comb. 5 (1998)