192 citations · 482 across the 16 of their papers we have counts for
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011★ 1 cited
On the Caccetta-Haggkvist conjecture with forbidden subgraphs
Alexander Razborov
The Caccetta-Haggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length <= l must contain a vertex of outdegree at most (n-1)/l. I…
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…