Speaker：Dong Ye (Middle Tennessee State University)

Time：2024-7-4, 10:00

Location：Conference Room 661 at the 6th floor of Shuli Building at Haiyun Campus

Abstract:

A cycle cover of a graph is a family of cycles which cover every edge of the graph. A graph has a cycle cover if and only if it has no bridge. The well-known cycle double cover conjecture says every bridgeless graph has a family of cycles that cover every edge exactly twice. In this talk, we present some results and methods towards solving this conjecture.