UVic Discrete Math Seminar: Reza Naserasr

Abstract: The cycle double cover conjecture asserts that every bridgeless graph admits a collection of cycles in which each edge occurs exactly twice. In this talk we present the conjecture’s historical roots and proof developed with OpenAI.

We begin with the motivations and early developments that led to the conjecture. We then explain the proposed proof, using the Petersen graph as a running example to illustrate the construction of a cycle double cover. If time permits, we discuss potential strengthenings and extensions.