{
  "aliases": [
    "alon-saks-seymour-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn graph theory, the **Graham–Pollak theorem** states that the edges of an $n$-vertex [[complete graph|03WKB2H474]] cannot be partitioned into fewer than $n-1$ [[complete bipartite graphs|0V0GC7BQAN]]. It was first published by Ronald Graham and Henry O. Pollak in two papers in 1971 and 1972 (crediting Hans Witsenhausen for a key lemma), in connection with an application to telephone switching circuitry.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "alon-saks-seymour-conjecture"
    ],
    "inventory": [
      "69TQR87GAM"
    ],
    "kind": "statement",
    "name": "Graham–Pollak theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q97273070",
      "wikipedia": "Graham–Pollak theorem"
    },
    "sources": [
      {
        "locator": "Graham–Pollak theorem",
        "mention": "wikipedia://en/64527577",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:64527577@r1375060215"
      }
    ],
    "tag": "XAZ1R146FX"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/XAZ1R146FX/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/XAZ1R146FX.md",
  "msc": null,
  "name": "Graham–Pollak theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/XAZ/XAZ1R146FX.md",
  "status": null,
  "tag": "XAZ1R146FX",
  "uri": "m2://XAZ1R146FX",
  "url": "https://math2.tamnd.com/wiki/graham-pollak-theorem/",
  "writing": {
    "tag": "XAZ1R146FX",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}