86 citations · 344 across the 93 of their papers we have counts for
7 papers · 1 filter
Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables
Alan Frieze, Páll Melsted
We study the the following question in Random Graphs. We are given two disjoint sets with and . We construct a random graph by allowing each to…
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…
Hamilton cycles in 3-out
Tom Bohman, Alan Frieze
Let G_{\rm 3-out} denote the random graph on vertex set [n] in which each vertex chooses 3 neighbors uniformly at random. Note that G_{\rm 3-out} has minimum degree 3 and average d…
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…
Logconcave Random Graphs
Alan Frieze, Santosh Vempala, Juan Vera
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is…