Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs

Gregory Gutin, Ruijuan Li

Seymour's second neighbourhood conjecture asserts that every oriented graph has a vertex whose second out-neighbourhood is at least as large as its out-neighbourhood. In this paper…