1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008★ 1 cited
The triangle-free process
Tom Bohman
Consider the following stochastic graph process. We begin with the empty graph on n vertices and add edges one at a time, where each edge is chosen uniformly at random from the col…
math.CO2007
The game chromatic number of random graphs
Tom Bohman, Alan Frieze, Benny Sudakov
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wi…
math.CO2005
First Order Definability of Trees and Sparse Random Graphs
Tom Bohman, Alan Frieze, Tomasz Luczak +4
Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the…