Sullivan, Matthew A.2021-10-062021-10-062021-10-062021-09-24http://hdl.handle.net/10012/17627A complete rotation system on n vertices is a collection of n cyclic permutations of the elements [n]\{i}, for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges at v. In particular, the collection of all vertex rotations of a simple drawing of Kn is a complete rotation system. Can we characterize when a complete rotation system can be represented as a simple drawing of Kn (a.k.a. realizable)? This thesis is motivated by two specific results on complete rotation systems. The first motivating theorem was published by Kyncl in 2011, who, using homotopy, proved as a corollary that if all complete 6-vertex rotation systems of a complete n-vertex rotation system H are realizable, then H is realizable. Combined with communications with Aichholzer, Kyncl determined that complete realizable n-vertex rotation systems are characterized by their complete 5-vertex rotation systems. The second motivating theorem was published by Gioan in 2005, he proved that if two simple drawings of the complete graph D and D′ have the same rotation system, then there is a sequence of Reidemeister III moves that transforms D into D′. Motivated by these results, we prove both facts combinatorially by sequentially drawing the edge crossings of an edge to form a simple drawing. Such a method can be used to prove both theorems, generate every simple drawing of a complete rotation system, or find a non-realizable complete 5-vertex rotation system in any complete rotation system (when one exists).engraph theorycombinatoricsgraph drawingsGraph theoryCombinatorial analysisDoctoral Thesis