Presented by: 
Jeff Dinitz, University of Vermont
Date: 
Wed 16 Apr, 2:00 pm - 3:00 pm
Venue: 
Building 67, Room 442

Our goal is to embed the complete graph K_n on a surface (orientable closed 2-manifold) so that each face is either an s-cycle or a t-cycle and each edge bounds exactly one face of each size. We accomplish this by use of an s x t array termed a Heffter array.  These arrays are interesting in their own right and in this talk we will discuss their construction as well as their application to the embedding problem.