{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn [[combinatorial|0JKW7W7XFR]] mathematics, the **Albertson conjecture** is an unproven relationship between the crossing number and the chromatic number of a [[graph|00C0BR7D7H]]. It is named after Michael O. Albertson, a professor at Smith College, who stated it as a conjecture in 2007; it is one of his many conjectures in [[graph coloring|0NCPXH194Y]] theory. The conjecture states that, among all graphs requiring $n$ colors, the [[complete graph|03WKB2H474]] $K_n$ is the one with the smallest crossing number. Equivalently, if a graph can be drawn with fewer crossings than $K_n$, then, according to the conjecture, it may be colored with fewer than $n$ colors.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "YC0GN15X1J"
    ],
    "kind": "conjecture",
    "name": "Albertson conjecture",
    "same_as": {
      "wikidata": "Q4712279",
      "wikipedia": "Albertson conjecture"
    },
    "sources": [
      {
        "locator": "Albertson conjecture",
        "mention": "wikipedia://en/24205238",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:24205238@r1335680995"
      }
    ],
    "tag": "3SWZNY66QZ"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/3SWZNY66QZ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/3SWZNY66QZ.md",
  "msc": null,
  "name": "Albertson conjecture",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/3SW/3SWZNY66QZ.md",
  "status": null,
  "tag": "3SWZNY66QZ",
  "uri": "m2://3SWZNY66QZ",
  "url": "https://math2.tamnd.com/wiki/albertson-conjecture/",
  "writing": {
    "tag": "3SWZNY66QZ",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}