{
  "aliases": [
    "overfull-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, an **overfull graph** is a [[graph|00C0BR7D7H]] whose [[size|00C0BR7D7H]] is greater than the product of its maximum [[degree|0KS0KRDV4Y]] and half of its [[order|00C0BR7D7H]] floored, i.e. $|E| \u003e \\Delta (G) \\lfloor |V|/2 \\rfloor$ where $|E|$ is the size of *G*, $\\displaystyle\\Delta(G)$ is the maximum degree of *G*, and $|V|$ is the order of *G*. The concept of an **overfull subgraph**, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph *S* of a graph *G* requires $\\displaystyle\\Delta (G) = \\Delta (S)$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "overfull-conjecture"
    ],
    "inventory": [
      "EN50Q7N1AF"
    ],
    "kind": "concept",
    "name": "Overfull graph",
    "same_as": {
      "wikidata": "Q7113657",
      "wikipedia": "Overfull graph"
    },
    "sources": [
      {
        "locator": "Overfull graph",
        "mention": "wikipedia://en/23472134",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:23472134@r1317723716"
      }
    ],
    "tag": "MH8R6VYK7S"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/MH8R6VYK7S/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/MH8R6VYK7S.md",
  "msc": null,
  "name": "Overfull graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/MH8/MH8R6VYK7S.md",
  "status": null,
  "tag": "MH8R6VYK7S",
  "uri": "m2://MH8R6VYK7S",
  "url": "https://math2.tamnd.com/wiki/overfull-graph/",
  "writing": {
    "tag": "MH8R6VYK7S",
    "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
      }
    ]
  }
}