  Seymour's Second Neighborhood Conjecture (SSNC) asserts that every oriented
finite simple graph (without digons) has a vertex whose second out-neighborhood
is at least as large as its first out-neighborhood. Such a vertex is said to
have the second neighborhood property (SNP). In this paper, we prove SSNC for
tournaments missing two stars. We also study SSNC for tournaments missing
disjoint paths and, particularly, in the case of missing paths of length 2. In
some cases, we exhibit at least two vertices with the SNP.
