University of Cambridge > Talks.cam > Combinatorics Seminar > Monochromatic cycle partitions

  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

Monochromatic cycle partitions

Download to your calendar using vCal

  • UserShoham Letzter (University of Cambridge)
  • ClockThursday 05 March 2015, 14:30-15:30
  • HouseMR12.

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

In 2011, Schelp introduced the idea of considering Ramsey-Turán type problems for graphs with large minimum degree. Inspired by his questions, Balogh, Barát, Gerbner, Gyárfás, and Sárközy suggested the following conjecture. Let G be a graph on n vertices with minimum degree at least 3n/4. Then for every red and blue colouring of the edges of G, the vertices of G may be partitioned into two vertex-disjoint cycles, one red and the other blue. They proved an approximate version of the conjecture, and recently DeBiasio and Nelsen obtained a stronger approximate result. We prove the conjecture exactly (for large n).

I will give an overview of the history of this problem and describe some of the tools that are used for the proof. I will finish with a discussion of possible future work for which the methods we use may be applicable.

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

Quantum Computing Seminar Ray Dolby Centre, 2nd floor seminar room, PHY-RDC B2.002 FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Angular analyses of b -> s ee decays at LHCb What’s my reproduction number? Life history strategies: an interdisciplinary perspective Precarity and the economy of makeshifts: A novel argument from the census of England, 1851-1911 Title to be confirmed Polar Oceans Seminar Talk Title to be confirmed
 

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