COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Clique colourings of random graphsAdd to your list(s) Download to your calendar using vCal - Colin McDiarmid (University of Oxford)
- Thursday 10 March 2016, 14:30-15:30
- MR12.
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. ## 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
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsIfM Research Capability Development Programme Seminar Series ERC Equipoise Holocaust Memorial Day## Other talksThe Beginning of Our Universe and what we don't know about Physics Advances in understanding and treatment of eating disorders The genetics of depression Numerical solution of the radiative transfer equation with a posteriori error bounds |