Learn More
The second neighborhood conjecture of Seymour asserts that for any orientation G = (V,E), there exists a vertex v ∈ V so that |N(v)| ≤ |N(v)|. The conjecture was resolved by Fisher for tournaments. In this paper we prove the second neighborhood conjecture for several additional classes of dense orientations. We also prove some approximation results, and(More)
  • 1