Albertson conjecture
id:
albertson-conjecture-190-8442525
title:
Albertson conjecture
text:
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 K n is the one with the smallest crossing number.
Equivalently, if a graph can be drawn with fewer
brand slug:
wiki
category slug:
encyclopedia
description:
Relation between graph coloring and crossings
original url:
https://en.wikipedia.org/wiki/Albertson_conjecture
date created:
date modified:
2023-08-14T16:48:23Z
main entity:
{"identifier":"Q4712279","url":"https://www.wikidata.org/entity/Q4712279"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/07/Complete_graph_K6_with_3_crossings.svg","width":554,"height":532}
fields total:
13
integrity:
15