Coloring directed hypergraphs (Q6098101)

For a hypergraph, the property of having a coloring of the vertices so that no edge is monochromatic is a well-known attribute known as Property B or \(2\)-colorability. In this paper, the author presents a condition for directed hypergraphs (hypergraphs where the vertices of every edge are partitioned into two parts, a tail and a head) which he (jointly with Palvölgyi) conjectures is sufficient for \(2\)-colorability of directed hypergraphs. The author proves this conjecture for \(3\)-uniform hypergraphs, and also for linear hypergraphs. Along the way, the author also deduces results concerning the maximum number of edges in a \(3\)-uniform directed hypergraph not containing a certain \(2\)-edge hypergraph as a subhypergraph, and also regarding so-called polychromatic colorings of hypergraphs.