{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "C7YBT20J0G"
    ],
    "kind": "conjecture",
    "name": "Second neighborhood problem",
    "same_as": {
      "wikidata": "Q60792926",
      "wikipedia": "Second neighborhood problem"
    },
    "sources": [
      {
        "locator": "Second neighborhood problem",
        "mention": "wikipedia://en/59632528",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:59632528@r1345329964"
      }
    ],
    "tag": "G9M7VGCBB6"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/G9M7VGCBB6/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/G9M7VGCBB6.md",
  "msc": null,
  "name": "Second neighborhood problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/G9M/G9M7VGCBB6.md",
  "status": null,
  "tag": "G9M7VGCBB6",
  "uri": "m2://G9M7VGCBB6",
  "url": "https://math2.tamnd.com/wiki/second-neighborhood-problem/",
  "writing": {
    "tag": "G9M7VGCBB6",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}