Towards The Albertson Conjecture
Combinatorics
2009-09-03 v1
Abstract
Albertson conjectured that if a graph has chromatic number then its crossing number is at least as much as the crossing number of . Albertson, Cranston, and Fox verified the conjecture for . We prove the statement for .
Keywords
Cite
@article{arxiv.0909.0413,
title = {Towards The Albertson Conjecture},
author = {János Barát and Géza Tóth},
journal= {arXiv preprint arXiv:0909.0413},
year = {2009}
}
Comments
13 pages, 4 figures