Metraipolis › archive › dc_d21374076e91

Albertson conjecture — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Albertson_conjecture
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-08T04:11:37.764Z
SHA-256 of the archived text
80f3b76ddb8aaab251e63323f079b08a1d1037f098bbdce15dc1d1b0d5fe032c
Stable URL of this page
https://metraipolis.com/documento/dc_d21374076e91

How to cite

Albertson conjecture — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Albertson_conjecture (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d21374076e91 (Metraipolis archive dc_d21374076e91, sha256 80f3b76ddb8aaab251e63323f079b08a1d1037f098bbdce15dc1d1b0d5fe032c)
BibTeX
@misc{dcd21374076e91,
  title = {Albertson conjecture — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Albertson_conjecture},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d21374076e91; sha256 80f3b76ddb8aaab251e63323f079b08a1d1037f098bbdce15dc1d1b0d5fe032c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Albertson_conjecture. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In combinatorial mathematics, the Albertson conjecture is an unproven relationship between the crossing number and the chromatic number of a graph. 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 theory. The conjecture states that, among all graphs requiring n colors, the complete graph Kn is the one with the smallest crossing number. Equivalently, if a graph can be drawn with fewer crossings than Kn, then, according to the conjecture, it may be colored with fewer than n colors.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Albertson conjecture» — https://en.wikipedia.org/wiki/Albertson_conjecture
Wikidata Q4712279: «relation between graph coloring and crossings» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4712279
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Albertson_conjecture?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1379426819, consultata il 2026-11-08T04:08:03.686Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 92a35ab55c15b1fa3d13f7eb58d8fbaf79845f8550de5a7f8ffbbcce37ee129e