Extremal numbers for directed hypergraphs with two edges (Q1753023)

Summary: Let a \(2 \rightarrow 1\) directed hypergraph be a 3-uniform hypergraph where every edge has two tail vertices and one head vertex. For any such directed hypergraph \(F\), let the \(n\)th extremal number of \(F\) be the maximum number of edges that any directed hypergraph on \(n\) vertices can have without containing a copy of \(F\). In [Lect. Notes Comput. Sci. 5420, 54--65 (2009; Zbl 1194.68213)], \textit{M. Langlois} et al. determined the exact extremal number for a particular directed hypergraph and found the extremal number up to asymptotic equivalence for a second directed hypergraph. Each of these forbidden graphs had exactly two edges. In this paper, we determine the exact extremal numbers for every \(2 \rightarrow 1\) directed hypergraph that has exactly two edges.