New bounds towards the Erdős-Gallai cycle decomposition conjecture

Add to your list(s) Download to your calendar using vCal

• Richard Montgomery (Warwick)
• Thursday 09 February 2023, 15:15-16:15
• MR12.

If you have a question about this talk, please contact ibl10.

Note this seminar will start at 15:15

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 decomposed into O(n log log n) cycles and edges. I will discuss a new bound, obtained 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.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.