## Discrete Math Seminar: Dan Archdeacon

• Date: 11/19/2013
Speaker(s):
Dan Archdeacon, University of Vermont
Location:

University of British Columbia

Topic:

Embedding complete graphs with every triangle a face

Description:

A common problem is to embed the complete graph on a surface so that every face is a triangle. To be perverse, suppose that we require that every triangle is a face. Let K^{(n-2)/2} denote the complete graph of order n where every pair of vertices are joined by (n-2)/2 parallel edges. For every even n at least 6 we construct a triangular embedding of this multigraph into both orientable and non-orientable surfaces such that any three vertices form a face. We give many other related results.

Other Information:

Location: ESB 4133