{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "00TQV3F5S4"
    },
    {
      "field": "uses",
      "target": "0JG1KZSPFZ"
    },
    {
      "field": "uses",
      "target": "0WCKRBHFFD"
    }
  ],
  "body": "\n## Definition\n\nLet $G$ be a [[graph|0JD5C82QMB]].\nA clique in $G$ is a set $S$ of vertices of $G$ such that any two distinct vertices of $S$ are adjacent.\n\n## Remarks\n\nA set $S$ is a clique if and only if the [[induced subgraph|0V05FC4GKQ]] on $S$ is a [[complete graph|03WKB2H474]].\nA set is a clique in $G$ if and only if it is an [[independent set|0KZJ82WEPP]] in the [[complement graph|0RNMP6VCR2]].\nTo decide whether a graph has a clique of a given size is an NP-complete problem.\n\n## Explanations\n\n### L1 human\n\nA clique is a group of vertices that are all joined to each other.\nIn a social network, it is a group of people who all know each other.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0BYX1D7C2E",
    "kind": "definition",
    "msc": [
      "05C69"
    ],
    "name": "Clique",
    "sources": [
      {
        "locator": "Definitions",
        "url": "https://en.wikipedia.org/wiki/Clique_(graph_theory)"
      }
    ],
    "tag": "0G52BPNPKG"
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0G52BPNPKG/",
  "links": [
    {
      "field": "defines",
      "target": "0BYX1D7C2E"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0G52BPNPKG.md",
  "msc": [
    "05C69"
  ],
  "name": "Clique",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0G5/0G52BPNPKG.md",
  "status": null,
  "tag": "0G52BPNPKG",
  "uri": "m2://0G52BPNPKG",
  "url": "https://math2.tamnd.com/wiki/clique-definition/",
  "writing": {
    "tag": "0G52BPNPKG",
    "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
      }
    ]
  }
}