Pair dominating graphs

An oriented graph dominates pairs if for every pair of vertices u , v , there exists a vertex w such that the edges w u → and w v → both lie in G . We construct regular oriented triangle-free graphs with this property, and thereby we disprove a conjecture of Myers. We also construct oriented graphs for which each pair of vertices is dominated by a unique vertex.