Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, August 25, 2015, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Patrick Schnider
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.
Automatic MiSe System Software Version 1.4803M | admin login