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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, April 30, 2015, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Dániel Korándi

Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges incident to some vertex $v_0$, and repeatedly add an edge $xy$ if there is a vertex $z$ such that $xz$ and $zy$ are already in the graph and $xzy \in H$. We say that the process propagates if it reaches the complete graph before it terminates. In this talk we show that the threshold probability for propagation is $p=1/2\sqrt{n}$ using the differential equation method. As an application, we obtain the upper bound $p=1/2\sqrt{n}$ on the threshold probability that a random 2-dimensional simplicial complex is simply connected.

Joint work with Yuval Peled and Benny Sudakov

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