Homogeneous sets in hypergraphs with forbidden order-size pairs

Maria Axenovich, Dhruv Mubayi, Lea Weber

The well-known Erdős-Hajnal conjecture states that for any graph $F$, there exists $\epsilon >0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous…