Some Results on Crossing Numbers
Loading...
Embargo Date
Degree type
Doctor of Philosophy (PhD)
Graduate group
Mathematics
Discipline
Subject
Mathematics
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract
The drawing of the complete graph in which the vertices are placed on the rims of a cylinder and connected with geodesic edges is conjectured to produce the minimum number of edge crossings for a complete graph, which is its crossing number. This dissertation proves that no edge in this drawing can be redrawn to reduce the total number of edge crossings.
Advisor
Date of degree
1971