Seymour's Second Neighborhood Conjecture for Subsets of Vertices

Tyler Seacrest

Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. In this note, we put forward a conjecture that w…