A proof of Seymour’s second-neighborhood conjecture
Every nonempty finite oriented graph has a vertex such that .
The proof by contradiction is complete and rigorous; both Proposition 2.1 and Proposition 4.1 are fully proved in the manuscript.
“Theorem 1.1. Every nonempty finite oriented graph has a vertex v such that |N_1^+(v)| \le |N_2^+(v)|.” · Show in paper