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, October 27, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Jozef Skokan (Univ. of Illinois at Urbana-Champaign and Univ. de São Paulo)

Generalized Turán Theorem

For two graphs G and H we denote by ex(G,H) the maximum number of edges in a subgraph of G that does not contain H. When G is the complete graph on n vertices we obtain the Turán number ex(n,H) whose value is asymptotically given by Erdős - Stone - Simonovits theorem. In this talk we will review results and present some new ones for the case when G is not the complete graph.

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