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, November 07, 2017, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Dmitry Shabanov (Lomonosov Moscow State University)

On the chromatic number of a sparse random hypergraph

The talk deals with estimating the chromatic number of a random n-vertex k-uniform hypergraph in the binomial model H(n,k,p). We concentrate on the sparse regime when the expected number of edges is a linear function of n. It is well known that in this case the chromatic number of H(n,k,p) is bounded and has a two point concentration. We give a new lower bound for the probability threshold for r-colorability property, which improves the previous result of Dyer, Freeze and Greenhill (2015) and complements the recent result of Ayre, Coja-Oghlan and Greenhill. The proof is based on a simple approach to the second moment method.


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

Previous talks by year:   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