2 papers
math.CO2009
The scaling window for a random graph with a given degree sequence
Hamed Hatami, Michael Molloy
We consider a random graph on a given degree sequence , satisfying certain conditions. We focus on two parameters . Molloy and Reed proved t…
math.CO2009
Sharp thresholds for constraint satisfaction problems and homomorphisms
Hamed Hatami, Michael Molloy
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hyperg…