Tom Bohman

According to our database, Tom Bohman authored at least 51 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

On Multicolor Ramsey Numbers of Triple System Paths of Length 3.

Tom Bohman, Emily Zhu

SIAM J. Discret. Math., September, 2023

A Construction for Boolean Cube Ramsey Numbers.

Tom Bohman, Fei Peng

Order, July, 2023

2022

Independent sets in hypergraphs omitting an intersection.

Tom Bohman, Xizhi Liu, Dhruv Mubayi

Random Struct. Algorithms, 2022

2021

Dynamic concentration of the triangle-free process.

Tom Bohman, Peter Keevash

Random Struct. Algorithms, 2021

2019

Large girth approximate Steiner triple systems.

Tom Bohman, Lutz Warnke

J. Lond. Math. Soc., 2019

A natural barrier in random greedy hypergraph matching.

Patrick Bennett, Tom Bohman

Comb. Probab. Comput., 2019

Independence Number of Graphs with a Prescribed Number of Cliques.

Tom Bohman, Dhruv Mubayi

Electron. J. Comb., 2019

2018

A greedy algorithm for finding a large 2-matching on a random cubic graph.

Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze

J. Graph Theory, 2018

2017

More on the Bipartite Decomposition of Random Graphs.

Noga Alon, Tom Bohman, Hao Huang

J. Graph Theory, 2017

2016

A note on the random greedy independent set algorithm.

Patrick Bennett, Tom Bohman

Random Struct. Algorithms, 2016

2013

On the Independence Numbers of the Cubes of Odd Cycles.

Tom Bohman, Ron Holzman, Venkatesh Natarajan

Electron. J. Comb., 2013

2012

Turán Densities of Some Hypergraphs Related to K_k+1^k.

József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao

SIAM J. Discret. Math., 2012

SIR epidemics on random graphs with a fixed degree sequence.

Tom Bohman, Michael Picollelli

Random Struct. Algorithms, 2012

2011

Ramsey games with giants.

Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov

Random Struct. Algorithms, 2011

Karp-Sipser on Random Graphs with a Fixed Degree Sequence.

Tom Bohman, Alan M. Frieze

Comb. Probab. Comput., 2011

Random greedy triangle-packing beyond the 7/4 barrier

Tom Bohman, Alan M. Frieze, Eyal Lubetzky

CoRR, 2011

2010

Flips in Graphs.

Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko

SIAM J. Discret. Math., 2010

Coloring H-free hypergraphs.

Tom Bohman, Alan M. Frieze, Dhruv Mubayi

Random Struct. Algorithms, 2010

Anti-Ramsey properties of random graphs.

Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth

J. Comb. Theory, Ser. B, 2010

A note on the random greedy triangle-packing algorithm

Tom Bohman, Alan M. Frieze, Eyal Lubetzky

CoRR, 2010

Hypergraphs with independent neighborhoods.

Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko

Comb., 2010

2009

Memoryless Rules for Achlioptas Processes.

Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko

SIAM J. Discret. Math., 2009

Hamilton cycles in 3-out.

Tom Bohman, Alan M. Frieze

Random Struct. Algorithms, 2009

Erdos-Ko-Rado in Random Hypergraphs.

József Balogh, Tom Bohman, Dhruv Mubayi

Comb. Probab. Comput., 2009

Maximum Independent Sets in Certain Powers of Odd Cycles.

Tom Bohman, Ron Holzman, Venkatesh Natarajan

Electron. J. Comb., 2009

2008

Game chromatic index of graphs with given restrictions on degrees.

Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko

Theor. Comput. Sci., 2008

The game chromatic number of random graphs.

Tom Bohman, Alan M. Frieze, Benny Sudakov

Random Struct. Algorithms, 2008

2007

Randomly generated intersecting hypergraphs II.

Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Cliff Smyth

Random Struct. Algorithms, 2007

First-Order Definability of Trees and Sparse Random Graphs.

Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky

Comb. Probab. Comput., 2007

2006

A phase transition for avoiding a giant component.

Tom Bohman, Jeong Han Kim

Random Struct. Algorithms, 2006

Creating a Giant Component.

Tom Bohman, David Kravitz

Comb. Probab. Comput., 2006

2004

Avoidance of a giant component in half the edge set of a random graph.

Tom Bohman, Alan M. Frieze, Nicholas C. Wormald

Random Struct. Algorithms, 2004

Adding random edges to dense graphs.

Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin

Random Struct. Algorithms, 2004

On the irregularity strength of trees.

Tom Bohman, David Kravitz

J. Graph Theory, 2004

Linear Versus Hereditary Discrepancy.

Tom Bohman, Ron Holzman

Comb., 2004

2003

A nontrivial lower bound on the Shannon capacities of the complements of odd cycles.

Tom Bohman, Ron Holzman

IEEE Trans. Inf. Theory, 2003

Arc-Disjoint Paths in Expander Digraphs.

Tom Bohman, Alan M. Frieze

SIAM J. Comput., 2003

How many random edges make a dense graph hamiltonian?

Tom Bohman, Alan M. Frieze, Ryan R. Martin

Random Struct. Algorithms, 2003

A note on G-intersecting families.

Tom Bohman, Ryan R. Martin

Discret. Math., 2003

On Randomly Generated Intersecting Hypergraphs.

Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó

Electron. J. Comb., 2003

2002

Addendum to avoiding a giant component.

Tom Bohman, Alan M. Frieze

Random Struct. Algorithms, 2002

On a list coloring conjecture of Reed.

Tom Bohman, Ron Holzman

J. Graph Theory, 2002

On partitions of discrete boxes.

Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman

Discret. Math., 2002

2001

Avoiding a giant component.

Tom Bohman, Alan M. Frieze

Random Struct. Algorithms, 2001

G-Intersecting Families.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Comb. Probab. Comput., 2001

Six Lonely Runners.

Tom Bohman, Ron Holzman, Daniel J. Kleitman

Electron. J. Comb., 2001

Vertex Covers by Edge Disjoint Cliques.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Comb., 2001

2000

Note on Sparse Random Graphs and Cover Graphs.

Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Electron. J. Comb., 2000

Min-Wise Independent Linear Permutations.

Tom Bohman, Colin Cooper, Alan M. Frieze

Electron. J. Comb., 2000

1999

Random threshold growth dynamics.

Tom Bohman, Janko Gravner

Random Struct. Algorithms, 1999

1998

A Construction for Sets of Integers with Distinct Subset Sums.

Tom Bohman

Electron. J. Comb., 1998