About the Second Neighborhood Problem in Tournaments Missing Disjoint Stars
2016
Salman Fawzi Ghazal

Metrics

  • Eye Icon 204 views
  • Download Icon 96 downloads
Metrics Icon 204 views  //  96 downloads
About the Second Neighborhood Problem in Tournaments Missing Disjoint Stars Image
Abstract

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.

Full text
Show more arrow
 

Metrics

  • Eye Icon 204 views
  • Download Icon 96 downloads
Metrics Icon 204 views  //  96 downloads