Date of Award

1971

Degree Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Graduate Group

Mathematics

First Advisor

Herbert Wilf

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.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Included in

Mathematics Commons

Share

COinS