First Name:
Faith
Last Name:
Miller
Major Department:
Mathematical Sciences
Thesis Director:
Mark Ginn
Date of Thesis:
May 2014
During World War II, the crossing number problem in Graph Theory was created. The problem is solved by minimizing the number of times edges cross at somewhere other than a vertex. In this paper, we will discuss the history of the crossing number problem, current theorems, techniques for looking at tripartite graph crossing number, and ways to improve on the bounds of the K3,3,3 crossing number. We will also discuss techniques to create a general theorem for these crossing numbers.