Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms
组合数学
2007-05-23 v1 概率论
摘要
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 3.
引用
@article{arxiv.math/0612391,
title = {Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms},
author = {Hamed Hatami and Michael Molloy},
journal= {arXiv preprint arXiv:math/0612391},
year = {2007}
}