## 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, November 06, 2008, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Andreas Razen

## Counting Crossing-Free Geometric Graphs with Exponential Speed-Up (Part II)

In this talk we will show that for a point set $P$ with triangular convex hull there is a constant $\alpha>0$ such that a triangulation on $P$ chosen uniformly at random contains, in expectation, at least $n/\alpha$ non-flippable edges. We will prove $\alpha \geq 1/4$ and outline how to obtain even better bounds.

Joint work with Emo Welzl.

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