BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:New bounds towards the Erdős-Gallai cycle decomposition conjectur
 e  - Richard Montgomery (Warwick)
DTSTART:20230209T151500Z
DTEND:20230209T161500Z
UID:TALK196759@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:In the 1960s\, Erdős and Gallai conjectured that the edges of
  any n-vertex graph can be decomposed into O(n) cycles and edges. In 2014\
 , Conlon\, Fox and Sudakov showed that any n-vertex graph can be decompose
 d into O(n log log n) cycles and edges. I will discuss a new bound\, obtai
 ned with Matija Bucić\, that shows that O(n logstar(n)) cycles and edges 
 are sufficient for such a decomposition\, where logstar(n) is the iterated
  logarithm function.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR