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, August 25, 2015, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Patrick Schnider

Partitions with Plane Spanning Double Stars

Given a complete geometric graph with an even number of vertices, can its edge set be partitioned into plane spanning trees? We investigate this question for plane spanning double stars instead of general spanning trees. We give a necessary, as well as a sufficient condition for the existence of a partition into plane spanning double stars. We also construct complete geometric graphs with an even number of vertices that cannot be partitioned into plane spanning double stars.


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