{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "07DVHJ8N0A"
    }
  ],
  "body": "\n## Summary\n\nA bipartite graph is a graph whose vertices split into two parts with every edge between the parts. Bipartite graphs model relations between two kinds of object, and they are the setting of matching theory. The node [[bipartite graph|07DVHJ8N0A]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05C75"
    ],
    "name": "Bipartite graph",
    "same_as": {
      "wikidata": "Q174733",
      "wikipedia": "Bipartite graph"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Bipartite_graph"
      }
    ],
    "tag": "0ZVQKTRKVQ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0ZVQKTRKVQ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0ZVQKTRKVQ.md",
  "msc": [
    "05C75"
  ],
  "name": "Bipartite graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0ZV/0ZVQKTRKVQ.md",
  "status": null,
  "tag": "0ZVQKTRKVQ",
  "uri": "m2://0ZVQKTRKVQ",
  "url": "https://math2.tamnd.com/wiki/bipartite-graph/",
  "writing": {
    "tag": "0ZVQKTRKVQ",
    "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
      }
    ]
  }
}