Towards The Albertson Conjecture
classification
🧮 math.CO
keywords
albertsonnumberconjecturecrossingchromaticconjecturedcranstongraph
read the original abstract
Albertson conjectured that if a graph $G$ has chromatic number $r$ then its crossing number is at least as much as the crossing number of $K_r$. Albertson, Cranston, and Fox verified the conjecture for $r\le 12$. We prove the statement for $r\le 16$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.