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 29, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Gyula Károlyi (Eötvös University)

Erdős-Szekeres theorem with forbidden order types

According to the classical Erdős-Szekeres theorem, every sufficiently large set of points, in general position in the plane, contains a large subset in convex position. Parallel to the Erdős-Hajnal problem in graph Ramsey theory, we investigate how large such subsets must a configuration contain if it does not have any sub-configuration belonging to a fixed order type.

(Joint work with Jozsef Solymosi)

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