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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, November 14, 2017, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Natasha Morrison (University of Oxford)

The r-neighbour bootstrap process on a graph G starts with an initial set of 'infected' vertices and, at each step of the process, a healthy vertex becomes infected if it has at least r infected neighbours (once a vertex becomes infected, it remains infected forever). If every vertex of G becomes infected during the process, then we say that the initial set percolates. In this talk I will discuss the proof of a conjecture of Balogh and Bollobas: for fixed r and d going to infinity, the minimum cardinality of a percolating set in the d-dimensional hypercube is $\frac{1+o(1)}{r}\binom{d}{r-1}$. This is joint work with Jonathan Noel.

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