Sharp thresholds for constraint satisfaction problems and homomorphisms
Combinatorics
2009-03-17 v1 Probability
Abstract
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the -model, and binary constraint satisfaction problems with domain size three.
Cite
@article{arxiv.0903.2579,
title = {Sharp thresholds for constraint satisfaction problems and homomorphisms},
author = {Hamed Hatami and Michael Molloy},
journal= {arXiv preprint arXiv:0903.2579},
year = {2009}
}