3 citations · 6 across the 14 of their papers we have counts for
4 papers · 1 filter
Ramsey games with giants
Tom Bohman, Alan Frieze, Michael Krivelevich +2
The classical result in the theory of random graphs, proved by Erdos and Renyi in 1960, concerns the threshold for the appearance of the giant component in the random graph process…
Flips in Graphs
Tom Bohman, Andrzej Dudek, Alan Frieze +1
We study a problem motivated by a question related to quantum-error-correcting codes. Combinatorially, it involves the following graph parameter: $$f(G)=\min\set{|A|+|\{x\in V\setm…
Coloring H-free Hypergraphs
Tom Bohman, Alan Frieze, Dhruv Mubayi
Fix and a collection of -uniform hypergraphs $\cH$. What is the minimum number of edges in an $\cH$-free -uniform hypergraph with chromatic number greater than .…
Randomly colouring simple hypergraphs
Alan Frieze, Pall Melsted
We study the problem of constructing a (near) random proper -colouring of a simple k-uniform hypergraph with n vertices and maximum degree Δ. (Proper in that no edge is mono-col…