Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms

Simple item page
dc.creatorHatami, Hamed
dc.creatorMolloy, Michael
dc.date2006-12-14
dc.date.accessioned2026-07-07T07:34:52Z
dc.date.available2026-07-07T07:34:52Z
dc.descriptionWe 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 $(d,k,t)$-model, and binary constraint satisfaction problems with domain size 3.
dc.identifierhttps://arxiv.org/abs/math/0612391
dc.identifierhttp://arxiv.org/abs/math/0612391
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119918
dc.subjectCombinatorics
dc.subjectProbability
dc.subject05C80
dc.titleSharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms
dc.typetext

Files

Collections

arXiv