e/Albertson conjecture

Information
has gloss	eng: 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 many conjectures made by Albertson 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.
lexicalization	eng: Albertson conjecture
instance of	(noun) a hypothesis that has been formed by speculating or conjecturing (usually with little hard evidence); "speculations about the outcome of the election"; "he dismissed it as mere conjecture" conjecture, speculation