Colloquium

Starts: October 2, 2009 at 3:00 PM
Location: Jones Hall 301
Contact: Gexin Yu

Summary

Speaker: Mark Ellingham (Vanderbilt University)

Full Description

Title: Cycle double covers and graph embeddings

Abstract: A cycle double cover in a graph is a collection of
cycles that covers every edge exactly twice.  The Cycle
Double Cover Conjecture, first stated in the 1970s, says
that every 2-connected graph has a cycle double cover.
This is related to many other questions in graph theory, and
in particular to embeddings of graphs on surfaces.  We give
a general introduction to the Cycle Double Cover Conjecture
and associated graph embedding problems.  Then we discuss
some joint work with Xiaoya Zha of Middle Tennessee State
University, where we have shown that every 2-connected
graph embeddable on the projective plane has an orientable
cycle double cover.