## On the crossing numbers of complete graphs (2006)

Venue: | University of Waterloo |

Citations: | 2 - 1 self |

### BibTeX

@ARTICLE{Pan06onthe,

author = {Shengjun Pan},

title = {On the crossing numbers of complete graphs},

journal = {University of Waterloo},

year = {2006}

}

### OpenURL

### Abstract

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii In this thesis we prove two main results. The Triangle Conjecture asserts that the convex hull of any optimal rectilinear drawing of Kn must be a triangle (for n � 3). We prove that, for the larger class of pseudolinear drawings, the outer face must be a triangle. The other main result is the next step toward Guy’s Conjecture that the crossing number of Kn is 1