{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "05ZPH8KF9K"
    },
    {
      "field": "uses",
      "target": "AVTXQM3CNZ"
    },
    {
      "field": "uses",
      "target": "C9JJD2AVJR"
    }
  ],
  "body": "\n## Summary\n\nA perfect matching is a matching that covers every vertex of a graph. The theorems of Hall and Tutte say when a graph has one. The node [[perfect matching|05ZPH8KF9K]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "6QK8T6QRZD"
    ],
    "kind": "concept",
    "msc": [
      "05C70"
    ],
    "name": "Perfect matching",
    "same_as": {
      "wikidata": "Q99567093",
      "wikipedia": "Perfect matching"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Perfect_matching"
      }
    ],
    "specializes": [
      "0MJ04A50QW"
    ],
    "tag": "0NHK9MFFW9"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0NHK9MFFW9/",
  "links": [
    {
      "field": "specializes",
      "target": "0MJ04A50QW"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0NHK9MFFW9.md",
  "msc": [
    "05C70"
  ],
  "name": "Perfect matching",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0NH/0NHK9MFFW9.md",
  "status": null,
  "tag": "0NHK9MFFW9",
  "uri": "m2://0NHK9MFFW9",
  "url": "https://tamnd.github.io/math2/wiki/perfect-matching/",
  "writing": {
    "tag": "0NHK9MFFW9",
    "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
      }
    ]
  }
}