{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0FHM8DB6PM"
    }
  ],
  "body": "\n## Definition\n\nLet $G$ be a [[graph|0JD5C82QMB]] and let $e$ be an edge of $G$.\nLet $G - e$ be the graph that $G$ gives when $e$ is deleted and all vertices are kept.\nThe edge $e$ is a bridge of $G$ if $G - e$ has more [[connected components|01VVP10MWJ]] than $G$.\n\n## Remarks\n\nLet $e = uv$. Then $e$ is a bridge if and only if $u$ and $v$ are not [[reachable|0J8XE7W68F]] from each other in $G - e$. In this case, deleting $e$ increases the number of components by exactly one.\nIn a [[tree|0MJ0JS72DZ]] every edge is a bridge. In a [[cycle graph|0QQ0F12962]] no edge is a bridge.\n[[Bridges are the edges on no cycle|0FHM8DB6PM]].\n\n## Explanations\n\n### L1 human\n\nA bridge is an edge that holds the graph together: delete it, and one piece breaks into two.\nThink of the only road between two towns.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "defines": "0BANA3XYPF",
    "kind": "definition",
    "msc": [
      "05C40"
    ],
    "name": "Bridge",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Bridge_(graph_theory)"
      }
    ],
    "tag": "0D81KWH9ZM",
    "uses": [
      "01VVP10MWJ"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0D81KWH9ZM/",
  "links": [
    {
      "field": "defines",
      "target": "0BANA3XYPF"
    },
    {
      "field": "uses",
      "target": "01VVP10MWJ"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0D81KWH9ZM.md",
  "msc": [
    "05C40"
  ],
  "name": "Bridge",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0D8/0D81KWH9ZM.md",
  "status": null,
  "tag": "0D81KWH9ZM",
  "uri": "m2://0D81KWH9ZM",
  "url": "https://math2.tamnd.com/wiki/bridge-definition/",
  "writing": {
    "tag": "0D81KWH9ZM",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}