Domination in 3-tournaments

Dániel Korándi, Benny Sudakov

A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is containe…