8 citations · 18 across the 6 of their papers we have counts for
8 papers
Graph norms and Sidorenko's conjecture
Hamed Hatami
Let and be two finite graphs. Define to be the number of homomorphisms from to . The function extends in a natural way to a function from the s…
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…
On the Computational Complexity of Defining Sets
Hamed Hatami, Hossein Maserrat
Suppose we have a family of sets. For every , a set is a {\sf defining set} for if is the only element of th…
On the Complexity of the Circular Chromatic Number
Hamed Hatami, Ruzbeh Tusserkani
Circular chromatic number, is a natural generalization of chromatic number. It is known that it is \NP-hard to determine whether or not an arbitrary graph satisfies $χ(G)…