The Chromatic Number of Dense Random Graphs

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

• Annika Heckel (University of Oxford)
• Thursday 28 April 2016, 14:30-15:30
• MR12.

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

We consider the chromatic number of the dense random graph G(n,p) where p is constant. I will present new upper and lower bounds which are the first ones that match each other up to a term of size o(1) in the denominator. Somewhat surprisingly, the behaviour of the chromatic number changes around p=1-1/e², with a different limiting effect being dominant below and above this value. In contrast to earlier results in this range, the upper bound is obtained through the second moment method, and I will give details on some aspects of the proof.

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.