| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655004 | European Journal of Combinatorics | 2006 | 7 Pages |
Abstract
An oriented graph dominates pairs if for every pair of vertices u, v, there exists a vertex w such that the edges wuâ and wvâ 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Paul Balister, Béla Bollobás,