Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 30, 2017, 12:15 pm

Duration: 45 minutes

Location: CAB G51

Speaker: Charlotte Knierim

Clique coloring of dense random graphs

The clique chromatic number of a graph G is the minimum integer s such that we can color the vertices of G with s colors so that no maximal clique of size at least 2 is monochromatic. In this talk I will present results about the clique chromatic number of binomial random graphs. The main part of the talk will be on a result from Alon and Krivelevich where they prove that for dense binomial random graphs G=G(n,p) with p constant we have that with high probability the clique chromatic number of G is Omega(log n). Their work settles a problem of McDiarmid, Mitsche and Pralat who proved that the clique chromatic number is O(log n) with high probability.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login