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: Tuesday, April 30, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: József Solymosi (University of British Columbia)

On Erdos' unit distances problem

One of the oldest and most popular problem in combinatorial geometry is Erdos' unit distances problem; What is the largest number of unit distances determined by n points in the plane. The best known upper bound - which is still far from the conjectured value - is more than 30 years old. In this talk I will explain why is this problem so difficult and what are the possible ways to attack it.

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