| Δ+ 300 is a bound on the adjacent vertex distinguishing edge chromatic number H Hatami Journal of Combinatorial Theory, Series B 95 (2), 246-256, 2005 | 227 | 2005 |
| On the number of pentagons in triangle-free graphs H Hatami, J Hladký, D Králʼ, S Norine, A Razborov Journal of Combinatorial Theory, Series A 120 (3), 722-732, 2013 | 160 | 2013 |
| Graph norms and Sidorenko’s conjecture H Hatami Israel Journal of Mathematics 175, 125-150, 2010 | 128 | 2010 |
| Limits of locally–globally convergent graph sequences H Hatami, L Lovász, B Szegedy Geometric and Functional Analysis 24 (1), 269-296, 2014 | 108 | 2014 |
| Non-three-colourable common graphs exist H Hatami, J Hladký, S Norine, A Razborov Combinatorics, Probability and Computing 21 (5), 734-742, 2012 | 75 | 2012 |
| Undecidability of linear inequalities in graph homomorphism densities H Hatami, S Norine Journal of the American Mathematical Society 24 (2), 547-565, 2011 | 68 | 2011 |
| Structure of protocols for XOR functions H Hatami, K Hosseini, S Lovett SIAM Journal on Computing 47 (1), 208-217, 2018 | 62 | 2018 |
| On the spectrum of the forced matching number of graphs P Afshani, H Hatami, ES Mahmoodian arXiv preprint arXiv:0903.2578, 2009 | 62 | 2009 |
| Every locally characterized affine-invariant property is testable A Bhattacharyya, E Fischer, H Hatami, P Hatami, S Lovett Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 54 | 2013 |
| The scaling window for a random graph with a given degree sequence H Hatami, M Molloy Random Structures & Algorithms 41 (1), 99-123, 2012 | 51 | 2012 |
| A structure theorem for Boolean functions with small total influences H Hatami Annals of Mathematics, 509-533, 2012 | 49 | 2012 |
| The inducibility of blow-up graphs H Hatami, J Hirst, S Norine Journal of Combinatorial Theory, Series B 109, 196-212, 2014 | 42 | 2014 |
| The fractional chromatic number of graphs of maximum degree at most three H Hatami, X Zhu SIAM Journal on Discrete Mathematics 23 (4), 1762-1775, 2010 | 32 | 2010 |
| Sharp thresholds for constraint satisfaction problems and homomorphisms H Hatami, M Molloy Random Structures & Algorithms 33 (3), 310-332, 2008 | 32 | 2008 |
| Circular chromatic index of graphs of maximum degree 3 P Afshani, M Ghandehari, M Ghandehari, H Hatami, R Tusserkani, X Zhu Journal of Graph Theory 49 (4), 325-335, 2005 | 30 | 2005 |
| Amenability constants for semilattice algebras M Ghandehari, H Hatami, N Spronk Semigroup Forum 79, 279-297, 2009 | 25 | 2009 |
| Real analysis in computer science: A collection of open problems Y Filmus, H Hatami, S Heilman, E Mossel, R O’Donnell, S Sachdeva, ... Preprint available at https://simons. berkeley. edu/sites/default/files …, 2014 | 24 | 2014 |
| Random cubic graphs are not homomorphic to the cycle of size 7 H Hatami Journal of Combinatorial Theory, Series B 93 (2), 319-325, 2005 | 23 | 2005 |
| Estimating the distance from testable affine-invariant properties H Hatami, S Lovett 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 237-242, 2013 | 20 | 2013 |
| On the size of the minimum critical set of a Latin square M Ghandehari, H Hatami, ES Mahmoodian Discrete mathematics 293 (1-3), 121-127, 2005 | 19 | 2005 |
