Extremal problems for cycles in graphs

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

• Jacques Verstraëte (UCSD)
• Thursday 19 May 2016, 14:30-15:30
• MR12.

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

In this talk, I will give a selective survey of extremal problems for cycles in graphs. In particular, I will give proofs of some conjectures of Erdős on this topic, as well as a discussion of some of the main open problems in the area.

Partly joint work with Alexandr Kostochka and Benny Sudakov.

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.