2 problems

Let the directed triangle mean the cyclic tournament on three vertices, and say that a tournament has the Strong Erdős–Hajnal property when it satisfies the strong Erdős–Hajnal con…

Given a graph $G$ and an oriented graph $\vec H$, let $D(G,\vec H)$ be the number of orientations of $G$ containing no copy of $\vec H$, and define … Let $K^\circlearrowright_3$ de…