TY - JOUR
AU - Salman Fawzi Ghazal
T1 - About the Second Neighborhood Problem in Tournaments Missing Disjoint Stars
T2 - Electronic Journal of Graph Theory and Applications
JF - Electronic Journal of Graph Theory and Applications
DA - 2016///
PY - 2016
IS - 2
VL - 4
SP - 178
EP - 189
AB - Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some cases we exhibit two such vertices.
ER -