arxiv.org
A dense-case theorem for Seymour's second neighborhood conjecture
Seymour's second neighborhood conjecture asserts that every finite oriented graph has a vertex with at least as many exact second outneighbors as outneighbors. Established cases include...