University of Cambridge > Talks.cam > Combinatorics Seminar > New bounds towards the Erdős-Gallai cycle decomposition conjecture

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

Download to your calendar using vCal

  • UserRichard Montgomery (Warwick)
  • ClockThursday 09 February 2023, 15:15-16:15
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

MAB 205, Mary Allan Building, Faculty of Education, Hills Road, Cambridge CB2 8PQ Potter Room (B1.19) Senior Parlour, Gonville & Caius College

Other talks

Title tbc FILM: One With The Whale Evolution: Inevitable or Remarkable? Title to be confirmed TBC Market Failure, Organ Shortage, Pandemic and Climate Change: The Architecture of Cooperation
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity