Contributions to Seymour's Second Neighborhood Conjecture

James N. Brantner, Greg Brockman, Bill Kay +1

Let D be a simple digraph without loops or digons. For any v in V(D) let N_1(v) be the set of all nodes at out-distance 1 from v and let N_2(v) be the set of all nodes at out-dista…