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: Thursday, April 13, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Tibor Szabó

Turan's Theorem in the hypercube

Our main motivation is the following Turan-type question: what is the smallest number of edges one must delete from the n-dimensional hypercube in order to destroy all its d-dimensional subcubes. In the talk we plan to realize how much we don't have any idea, which then motivates us to study the corresponding Ramsey-type problem.

Joint work with Noga Alon.

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