{
  "aliases": [
    "complete-multipartite-graph",
    "k-partite-graph",
    "tripartite-graph",
    "tripartite-graphs-and-networks"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a part of mathematics, a **$k$-partite graph** is a [[graph|00C0BR7D7H]] whose vertices are (or can be) partitioned into $k$ different [[independent sets|08ANQHHG3P]]. Equivalently, it is a graph that can be [[colored|0NCPXH194Y]] with $k$ colors, so that no two endpoints of an edge have the same color. When $k = 2$ these are the [[bipartite graphs|07DVHJ8N0A]], and when $k = 3$ they are called the **tripartite graphs**.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "complete-multipartite-graph",
      "k-partite-graph",
      "tripartite-graph",
      "tripartite-graphs-and-networks"
    ],
    "inventory": [
      "VF6RBQ8ZHQ"
    ],
    "kind": "concept",
    "name": "Multipartite graph",
    "same_as": {
      "wikidata": "Q1718082",
      "wikipedia": "Multipartite graph"
    },
    "sources": [
      {
        "locator": "Multipartite graph",
        "mention": "wikipedia://en/39469099",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:39469099@r1370112005"
      }
    ],
    "tag": "520X5V4T56"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/520X5V4T56/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/520X5V4T56.md",
  "msc": null,
  "name": "Multipartite graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/520/520X5V4T56.md",
  "status": null,
  "tag": "520X5V4T56",
  "uri": "m2://520X5V4T56",
  "url": "https://math2.tamnd.com/wiki/multipartite-graph/",
  "writing": {
    "tag": "520X5V4T56",
    "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
      }
    ]
  }
}