{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet *G* be a graph with *n* vertices such that $G\\neq K_n, \\overline{K_n}$ where $\\overline{G}$ denotes the complement of *G*. Then $n + 2 \\leq \\chi_i(G) + \\chi_{i}(\\overline{G})\\leq 2n-1.$ These bounds are sharp for all values of *n*.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "MPG5FC5G0Q"
    ],
    "kind": "statement",
    "name": "Nordhaus–Gaddum inequality",
    "role": "proposition",
    "sources": [
      {
        "locator": "Incidence coloring, section Nordhaus–Gaddum inequality",
        "mention": "wikipedia://en/47290509#BARB",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:47290509@r1361633825"
      }
    ],
    "tag": "SNHHPKSZM9"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/SNHHPKSZM9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SNHHPKSZM9.md",
  "msc": null,
  "name": "Nordhaus–Gaddum inequality",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SNH/SNHHPKSZM9.md",
  "status": null,
  "tag": "SNHHPKSZM9",
  "uri": "m2://SNHHPKSZM9",
  "url": "https://math2.tamnd.com/wiki/nordhaus-gaddum-inequality/",
  "writing": {
    "tag": "SNHHPKSZM9",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}