{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nGalvin proved a considerably more general result: for every bipartite [[multigraph|0C62PZXX02]] $G$,\n\n$$\\chi'_\\ell(G) = \\chi'(G).$$\n\nBy [[Kőnig's edge-coloring theorem|0JP0ZF57PN]] the chromatic index of a bipartite multigraph equals its maximum degree, so $\\chi'_\\ell(G) = \\Delta(G)$. Taking $G = K_{n,n}$ recovers the Dinitz theorem.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "J7FXTYFVZE"
    ],
    "kind": "statement",
    "name": "Galvin's theorem",
    "role": "theorem",
    "sources": [
      {
        "locator": "Dinitz theorem, section Galvin's theorem",
        "mention": "wikipedia://en/920110#T5PL",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:920110@r1365511518"
      }
    ],
    "tag": "KNAAVNP65X"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/KNAAVNP65X/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/KNAAVNP65X.md",
  "msc": null,
  "name": "Galvin's theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KNA/KNAAVNP65X.md",
  "status": null,
  "tag": "KNAAVNP65X",
  "uri": "m2://KNAAVNP65X",
  "url": "https://math2.tamnd.com/wiki/galvins-theorem/",
  "writing": {
    "tag": "KNAAVNP65X",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}