8 citations · 18 across the 6 of their papers we have counts for
5 papers · 1 filter
On the size of the minimum critical set of a Latin square
Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian
A critical set in an array is a set of given entries, such that there exists a unique extension of to an Latin square and no proper subset of h…
A lower bound for the size of the largest critical sets in Latin squares
Hamed Hatami, Ebadollah S. Mahmoodian
A critical set in an array is a set of given entries, such that there exists a unique extension of to an Latin square and no proper subset of h…
Random cubic graphs are not homomorphic to the cycle of size 7
Hamed Hatami
We prove that a random cubic graph almost surely is not homomorphic to a cycle of size 7. This implies that there exist cubic graphs of arbitrarily high girth with no homomorphisms…
Sharp Thresholds for Constraint Satisfaction Problem and Graph 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…
Fourier analysis and large independent sets in powers of complete graphs
Mahya Ghandehari, Hamed Hatami
For constant and arbitrary , it was known that in the graph any independent set of size close to the maximum is close to some independent set of maximum size. We pro…