University of Cambridge > Talks.cam > Combinatorics Seminar > The Chromatic Number of Dense Random 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

The Chromatic Number of Dense Random Graphs

Download to your calendar using vCal

  • UserAnnika Heckel (University of Oxford)
  • ClockThursday 28 April 2016, 14:30-15:30
  • HouseMR12.

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/e2, 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:

Note that ex-directory lists are not shown.

Other lists

Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Department of Biochemistry, Sanger Building Lecture Theatre Room 606, Centre for Family Research

Other talks

CSAR lecture: Climate Repair (TBC) Mergers all the way down: simulating the origin of globular clusters in a galactic context The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Machine Learning for Spectral Geometry and Vice Versa Online Causal Inference Semina Coming soon
 

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