{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0WCKRBHFFD"
    }
  ],
  "body": "\n## Summary\n\nThe clique number of a finite graph is the size of its largest clique. It is a lower bound for the chromatic number. The node [[clique number|0WCKRBHFFD]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "N65RYYH85X"
    ],
    "kind": "concept",
    "msc": [
      "05C69"
    ],
    "name": "Clique number",
    "sources": [
      {
        "locator": "Definitions",
        "url": "https://en.wikipedia.org/wiki/Clique_(graph_theory)"
      }
    ],
    "tag": "04MQSQ1F5Q"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/04MQSQ1F5Q/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/04MQSQ1F5Q.md",
  "msc": [
    "05C69"
  ],
  "name": "Clique number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/04M/04MQSQ1F5Q.md",
  "status": null,
  "tag": "04MQSQ1F5Q",
  "uri": "m2://04MQSQ1F5Q",
  "url": "https://tamnd.github.io/math2/wiki/clique-number/",
  "writing": {
    "tag": "04MQSQ1F5Q",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}