{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn graph theory, **Robbins' theorem**, named after (txt), states that the graphs that have strong orientations are exactly the 2-edge-connected graphs. That is, it is possible to choose a direction for each edge of an undirected graph $G$, turning it into a [[directed graph|0KFYGSHHF5]] that has a path from every vertex to every other vertex, if and only if $G$ is connected and has no [[bridge|0BANA3XYPF]].\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "CG1HNY6JC6"
    ],
    "kind": "statement",
    "name": "Robbins' theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q7341043",
      "wikipedia": "Robbins' theorem"
    },
    "sources": [
      {
        "locator": "Robbins' theorem",
        "mention": "wikipedia://en/36633800",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:36633800@r1321322910"
      }
    ],
    "tag": "HTY44KYNYR"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/HTY44KYNYR/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/HTY44KYNYR.md",
  "msc": null,
  "name": "Robbins' theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/HTY/HTY44KYNYR.md",
  "status": null,
  "tag": "HTY44KYNYR",
  "uri": "m2://HTY44KYNYR",
  "url": "https://math2.tamnd.com/wiki/robbins-theorem/",
  "writing": {
    "tag": "HTY44KYNYR",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}