creator Wang, Lujia advisor Pelsmajer, Michael The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all possible drawings on a plane. The pairwise crossing number pcr(G) is the the minimum number of pairs of edges that cross at least once over drawings. In the rst part of this survey, we deal with the conjecture that pcr(G) = cr(G), and prove that this is true for 4-edge weighted maps on the annulus. Moreover, we develop methods for solving analogous n-edge problems including the classi cation of permutations on a circle. In the second part, we de ne the generalized crossing number cri(G) as the crossing number of a graph on the orientable surface of genus i. The crossing sequence is de ned as (cri(G))g(G) i=0 , where g(G) is the genus of the graph. This part aims at the conjecture that for each sequence of four numbers decreasing to 0, there is some graph with such numbers as its crossing sequence. We come up with a particular family of graphs which have concave crossing sequences of length 4, but partially prove it. Submitted by Liana Khananashvili (khananashvili@iit.edu) on 2013-10-17T18:34:57Z No. of bitstreams: 2 ThesisLujiaWangMS2013.pdf: 9356428 bytes, checksum: 973b24b6e0bcedb7b489cd5cffe64cce (MD5) SignedTitlePage.pdf: 603467 bytes, checksum: 4947e9398ca670b898bc070a1ad73c9d (MD5) Made available in DSpace on 2013-10-17T18:34:57Z (GMT). No. of bitstreams: 2 ThesisLujiaWangMS2013.pdf: 9356428 bytes, checksum: 973b24b6e0bcedb7b489cd5cffe64cce (MD5) SignedTitlePage.pdf: 603467 bytes, checksum: 4947e9398ca670b898bc070a1ad73c9d (MD5) Previous issue date: 2013-05 M.S. in Applied Mathematics, May 2013 2013-05-01 2013-05 http://hdl.handle.net/10560/3098 en Thesis born digital application/pdf In Copyright http://rightsstatements.org/page/InC/1.0/ Restricted Access MATH / Applied Mathematics Illinois Institute of Technology Affiliated department