A Refinement to the Upper Bound of the Minimum Crossing Number of the Cone of a Graph
Live Poster Session: Zoom LinkThursday, July 30th 1:15-2:30pm EDT Abstract: The Albertson Conjecture, formulated in 2008 and as yet proven only for n <= 16, states that if the chromatic number of a graph is at least n, then its crossing number is at least the crossing number of K_n, the complete graph with n … Read more