1 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
The scaling window for a random graph with a given degree sequence
Hamed Hatami, Michael Molloy
We consider a random graph on a given degree sequence , satisfying certain conditions. We focus on two parameters . Molloy and Reed proved t…
On generalizations of Gowers norms and their geometry
Hamed Hatami
Motivated by the definition of the Gowers uniformity norms, we introduce and study a wide class of norms. Our aim is to establish them as a natural generalization of the norm…
Sharp thresholds for constraint satisfaction problems and 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…
On the spectrum of the forced matching number of graphs
Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
Let be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching of is a subset of , such that is contained in no other perfect matc…
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3
This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…
is a Bound on the Adjacent Vertex Distinguishing Edge Chromatic Number
Hamed Hatami
An adjacent vertex distinguishing edge-coloring or an \avd-coloring of a simple graph is a proper edge-coloring of such that no pair of adjacent vertices meets the same set…