Albertson conjecture
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.
primaryTopic
Albertson conjecture
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.
has abstract
In combinatorial mathematics, ...... ored with fewer than n colors.
@en
Link from a Wikipage to an external page
Wikipage page ID
24.205.238
Wikipage revision ID
742.644.469
authorlink
Richard K. Guy
first
hypernym
type
comment
In combinatorial mathematics, ...... ored with fewer than n colors.
@en
label
Albertson conjecture
@en