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 20, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Tomasz Łuczak (Adam Mickiewicz University, Poznań, Poland)

On a generalization of VC-dimension

We introduce a certain generalization of VC-dimension and show how it can be used to study the chromatic number of graphs with large minimum degree. In particular, we state a result which, in some cases, can play a role analogous to that of the classical Haussler-Welzl theorem on the set systems of bounded VC-dimension.

This is a joint work with Stéphan Thomassé.

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