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: Tuesday, December 07, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Konstantinos Panagiotou

Coloring the Random Graph

Graph coloring and more generally random graphs have become one of the most prominent branches of combinatorics and combinatorial optimization. One of the most striking features of this field is the variety of methods and tools used to tackle its central problems. In this talk, a brief overview of the devised knowledge will be given, in particular known results about the chromatic number, pros und cons of the Greedy algorithm, coloring sparse graphs and the property of unique colorability.


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