{
  "aliases": [
    "k-edge-connected-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a connected [[graph|00C0BR7D7H]] is **$k$-edge-connected** if it remains connected whenever fewer than $k$ edges are removed.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "k-edge-connected-graph"
    ],
    "inventory": [
      "WR0VJX2BY6"
    ],
    "kind": "concept",
    "name": "Edge connectivity",
    "same_as": {
      "wikidata": "Q3034655",
      "wikipedia": "Edge connectivity"
    },
    "sources": [
      {
        "locator": "Edge connectivity",
        "mention": "wikipedia://en/4593774",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:4593774@r1363592878"
      }
    ],
    "tag": "6V7PY38C5F"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/6V7PY38C5F/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/6V7PY38C5F.md",
  "msc": null,
  "name": "Edge connectivity",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/6V7/6V7PY38C5F.md",
  "status": null,
  "tag": "6V7PY38C5F",
  "uri": "m2://6V7PY38C5F",
  "url": "https://math2.tamnd.com/wiki/edge-connectivity/",
  "writing": {
    "tag": "6V7PY38C5F",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}