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, March 20, 2014, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Ueli Peter

A graph $G$ is unversal with respect to a family of graphs $\mathcal{H}$ if every $H\in \mathcal{H}$ can be embedded into $G$. In this talk we present a partitioning lemma that helps to embed fixed graphs into the random graph $G(n;p)$. As applications we show how to derive new bounds for the edge probability $p$ for which a typical random graph $G(n; p)$ is universal with respect to some families of graphs. In particular, we improve the result of Johannsen, Krivelevich and Samotij for the universality of $G(n; p)$ with respect to the family of spanning bounded degree forests. In addition, we improve a result of Dellamonica, Kohayakawa, Rodl and Rucinski for the universality of $G(n; p)$ with respect to the family of bounded degree graphs with density $d$ much smaller than the maximum degree. Joint work with Asaf Ferber and Rajko Nenadov

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