University of Cambridge > > Combinatorics Seminar > Extremal problems for cycles in graphs

Extremal problems for cycles in graphs

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

  • UserJacques Verstraëte (UCSD)
  • ClockThursday 19 May 2016, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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