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: Thursday, April 25, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Michal Adamaszek (Universität Bremen)

Extremal graph theory and flag manifolds

Tools of extremal graph theory are useful in the study of the structure very dense graphs with additional constraints. In this talk I will show how to apply stability of Turan graphs to investigate dense graphs which triangulate spheres, manifolds, or more general pseudomanifolds. A representative result of this kind is: the n-vertex graph which maximizes the number of edges among flag 3-manifolds is the join of two cycles of length n/2. I will also give some motivation for the study of flag manifold triangulations and present open problems in extremal graph theory which arise from our study. Joint work with Jan Hladky.

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