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 01, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Rajko Nenadov

Large degenerate subgraphs of expanding graphs

The celebrated result of Friedman and Pippenger gives a sufficient expansion condition for the containment of all small trees (i.e. 1-degenerate graphs). It was further generalised by Haxell to larger trees and both results were subsequently utilised in proofs of universality of random graphs with respect to the family of almost-spanning bounded-degree trees. We take a step towards generalising these results to d-degenerate graphs. In particular, we show that certain expansion properties, which can be observed in random graphs, are sufficient for the containment of bounded-degree d-degenerate graphs. The proof relies on a simple greedy, deterministic embedding algorithm.

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