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, November 02, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Andreas Razen

On the Number of Crossing-Free Partitions

We show that convex position of a point set P in the plane, with n = |P|, minimizes the number of crossing-free partitions into partition classes of certain sizes. A partition of a point set in the plane is called crossing-free, if the convex hulls of the individual parts do not intersect. We also prove that for all n >= 5, convex position of the underlying point set P does not maximize the total number of crossing-free partitions, and show some more astonishing facts.

Joint work with Emo Welzl.

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