BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Clique colourings of random graphs - Colin McDiarmid (University o
 f Oxford)
DTSTART:20160310T143000Z
DTEND:20160310T153000Z
UID:TALK63128@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:A clique colouring of a graph is a colouring of the vertices s
 o that no maximal clique is monochromatic (ignoring isolated vertices). Th
 e smallest number of\ncolours in such a colouring is the clique chromatic 
 number.\n\nWe shall discuss the asymptotic behaviour of the clique chromat
 ic number of the random graph G(n\,p) for a wide range of edge probability
  p=p(n).  We also discuss random geometric graphs\, and see that with high
  probability the clique chromatic number is 2\, when the threshold distanc
 e r is at least a modest constant factor above the threshold for connectiv
 ity. Finally\, we see that the\nclique chromatic number is at most 14 for 
 any geometric graph.\n\nThis is recent joint work with Dieter Mitsche and 
 Pawel Pralat.
LOCATION:MR12
END:VEVENT
END:VCALENDAR