Erd\H os--Hajnal problem for $H$-free hypergraphs
This paper deals with the minimum number $m_H(r)$ of edges in an $H$-free graph with the chromatic number more than $r$. We show how bounds on Ramsey and Turán numbers imply bounds on $m_H(r)$.
math.CO↗