Tom Bohman

According to our database1, Tom Bohman authored at least 48 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Dynamic concentration of the triangle-free process.
Random Struct. Algorithms, 2021

2019
Large girth approximate Steiner triple systems.
J. Lond. Math. Soc., 2019

A natural barrier in random greedy hypergraph matching.
Comb. Probab. Comput., 2019

Independence Number of Graphs with a Prescribed Number of Cliques.
Electron. J. Comb., 2019

2018
A greedy algorithm for finding a large 2-matching on a random cubic graph.
J. Graph Theory, 2018

2017
More on the Bipartite Decomposition of Random Graphs.
J. Graph Theory, 2017

2016
A note on the random greedy independent set algorithm.
Random Struct. Algorithms, 2016

2013
On the Independence Numbers of the Cubes of Odd Cycles.
Electron. J. Comb., 2013

2012
Turán Densities of Some Hypergraphs Related to K<sub>k+1</sub><sup>k</sup>.
SIAM J. Discret. Math., 2012

SIR epidemics on random graphs with a fixed degree sequence.
Random Struct. Algorithms, 2012

2011
Ramsey games with giants.
Random Struct. Algorithms, 2011

Karp-Sipser on Random Graphs with a Fixed Degree Sequence.
Comb. Probab. Comput., 2011

Random greedy triangle-packing beyond the 7/4 barrier
CoRR, 2011

2010
Flips in Graphs.
SIAM J. Discret. Math., 2010

Coloring H-free hypergraphs.
Random Struct. Algorithms, 2010

Anti-Ramsey properties of random graphs.
J. Comb. Theory, Ser. B, 2010

A note on the random greedy triangle-packing algorithm
CoRR, 2010

Hypergraphs with independent neighborhoods.
Comb., 2010

2009
Memoryless Rules for Achlioptas Processes.
SIAM J. Discret. Math., 2009

Hamilton cycles in 3-out.
Random Struct. Algorithms, 2009

Erdos-Ko-Rado in Random Hypergraphs.
Comb. Probab. Comput., 2009

Maximum Independent Sets in Certain Powers of Odd Cycles.
Electron. J. Comb., 2009

2008
Game chromatic index of graphs with given restrictions on degrees.
Theor. Comput. Sci., 2008

The game chromatic number of random graphs.
Random Struct. Algorithms, 2008

2007
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms, 2007

First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007

2006
A phase transition for avoiding a giant component.
Random Struct. Algorithms, 2006

Creating a Giant Component.
Comb. Probab. Comput., 2006

2004
Avoidance of a giant component in half the edge set of a random graph.
Random Struct. Algorithms, 2004

Adding random edges to dense graphs.
Random Struct. Algorithms, 2004

On the irregularity strength of trees.
J. Graph Theory, 2004

Linear Versus Hereditary Discrepancy.
Comb., 2004

2003
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles.
IEEE Trans. Inf. Theory, 2003

Arc-Disjoint Paths in Expander Digraphs.
SIAM J. Comput., 2003

How many random edges make a dense graph hamiltonian?
Random Struct. Algorithms, 2003

A note on G-intersecting families.
Discret. Math., 2003

On Randomly Generated Intersecting Hypergraphs.
Electron. J. Comb., 2003

2002
Addendum to avoiding a giant component.
Random Struct. Algorithms, 2002

On a list coloring conjecture of Reed.
J. Graph Theory, 2002

On partitions of discrete boxes.
Discret. Math., 2002

2001
Avoiding a giant component.
Random Struct. Algorithms, 2001

G-Intersecting Families.
Comb. Probab. Comput., 2001

Six Lonely Runners.
Electron. J. Comb., 2001

Vertex Covers by Edge Disjoint Cliques.
Comb., 2001

2000
Note on Sparse Random Graphs and Cover Graphs.
Electron. J. Comb., 2000

Min-Wise Independent Linear Permutations.
Electron. J. Comb., 2000

1999
Random threshold growth dynamics.
Random Struct. Algorithms, 1999

1998
A Construction for Sets of Integers with Distinct Subset Sums.
Electron. J. Comb., 1998


  Loading...