3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2008★ 3 cited
Coloring Simple Hypergraphs
Alan Frieze, Dhruv Mubayi
Fix an integer . A -uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant depending only on such that ever…
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…