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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 11, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Anna Gundert

The Containment Problem for Random 2-Complexes

In this talk we consider 2-complexes as complete graphs were some triangles have been added. Given a fixed 2-complex, consider the probability that a random 2-complex contains a copy of it. Just as for random graphs, the threshold for this is determined by the density of the densest subcomplex of the given 2-complex. What if we only want to find a subdivision of our complex in the random structure? Costa, Farber and Kappeler have shown that for any ε >0 the random complex X2(n,p) with p=n-1/2 + ε contains a subdivision of ANY fixed 2-complex. I will present work in progress on how this can be improved to p=c n-1/2, at least for fixed complexes with a constant number of vertices. Joint work with Uli Wagner

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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