Second neighborhood problem

In mathematics, the second neighborhood problem is an unsolved problem about oriented graphs posed by Paul Seymour. Intuitively, it suggests that in a social network described by such a graph, someone will have at least as many friends-of-friends as friends.The problem is also known as the second neighborhood conjecture or Seymour’s distance two conjecture. rdf:langString