COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Monochromatic cycle partitionsAdd to your list(s) Download to your calendar using vCal - Shoham Letzter (University of Cambridge)
- Thursday 05 March 2015, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsClimate Science Seminars within Cambridge Institution of Engineering and Technology Public Lectures Cambridge Next Generation Sequencing Bioinformatics Day II## Other talksStokes-Smoluchowski-Einstein-Langevin theory for active colloidal suspensions Auxin and cytokinin regulation of root architecture - antagonism or synergy Gambling Disorder in the UK: an overview Disaggregating goods Calcium signalling in bipolar disorder - new twists to an old story |