Second neighborhood problem
Statement
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.
Further reading
- Wikipedia, page 59632528, revision 1345329964, Second neighborhood problem. adopted
About this page
| Tag | G9M7VGCBB6 |
|---|---|
| URI | m2://G9M7VGCBB6 |
| Kind | conjecture |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status G9M7VGCBB6. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.