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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Extremal problems for cycles in graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7443.47727273 kWh Room U202, Cybercafe, Yusuf Hamied Department of Chemistry, Cambridge streaming ITA

Other talks

Carrollian momenta from anti de Sitter Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Title to be confirmed Dwarf Galaxies in the Local Universe Title TBC Title TBC
 

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