194 citations · 2.2k across the 69 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 55 cited
Non-three-colorable common graphs exist
Hamed Hatami, Jan Hladky, Daniel Kral +2
A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, e…
math.CO2011★ 166 cited
On the Number of Pentagons in Triangle-Free Graphs
Hamed Hatami, Jan Hladký, Daniel Král +2
Using the formalism of flag algebras, we prove that every triangle-free graph with vertices contains at most cycles of length five. Moreover, the equality is atta…