162 citations · 853 across the 40 of their papers we have counts for
Showing 2015 · cs.DMShow all
2 papers · 2 filters
cs.DM2015
Hypergraph coloring up to condensation
Peter Ayre, Amin Coja-Oghlan, Catherine Greenhill
Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the -colorability threshold in random -uniform hypergraphs up…
cs.DM2015★ 2 cited
The minimum bisection in the planted bisection model
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
In the planted bisection model a random graph with vertices is created by partitioning the vertices randomly into two classes of equal size (up to ). Any…