The seminars in Mathematical Modeling and Analysis are aimed at researchers, employees, and students.
This week's seminar is given by Klas Markström, Umeå University.
Title: The cycle double cover conjecture
Abstract: One of the longstanding open problems in graph theory is the cycle double cover conjecture. This conjecture says that every well-connected graph can be "nicely" embedded on some surface. The conjecture is known to be true for many graphs and much is known about the structure of any possible counterexample. In this survey talk I will give an introduction to this conjecture, what is known about it, and some even stronger conjectures.
