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

Mittagsseminar Talk Information

Date and Time: Tuesday, May 11, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Stefanie Gerke

Sparse epsilon-regular pairs

Szemeredi's regularity lemma is one of the most powerful tools in modern graph theory. Its main application is to find substructures in dense graphs, that is, in graphs with dn2 edges for a constant d. For graphs with o(n2) edges, Kohayakawa and Rdl adapted the definition of regularity to prove a regularity lemma for some classes of graphs, in particular random graphs. To apply this regularity lemma to find substructures some work remains to be done.

In this talk properties of sparse regularity are investigated which can be used to find small complete graphs in subgraphs of sparse random graphs.


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