Remarks on the second neighborhood problem
Dror Fidler, Raphael Yuster · Journal of Graph Theory · 2007
Abstract The second neighborhood conjecture of Seymour asserts that for any orientation G = (V,E), there exists a vertex υ ∈ V so that |N+(υ)| ≤ |N++(υ)|. The conjecture was resolved by Fisher for tournaments. In this article, we prove the second neighborhood conjecture for several additional classes of dense orientations. We also prove some approximation results, and reduce an asymptotic version of the conjecture to a finite case. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 208–220, 2007