University of Cambridge > > Combinatorics Seminar > Clique colourings of random graphs

Clique colourings of random graphs

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

  • UserColin McDiarmid (University of Oxford)
  • ClockThursday 10 March 2016, 14:30-15:30
  • HouseMR12.

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

A clique colouring of a graph is a colouring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colours in such a colouring is the clique chromatic number.

We shall discuss the asymptotic behaviour of the clique chromatic 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 distance r is at least a modest constant factor above the threshold for connectivity. Finally, we see that the clique chromatic number is at most 14 for any geometric graph.

This is recent joint work with Dieter Mitsche and Pawel Pralat.

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