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: Tuesday, December 19, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Paul Balister (Department of Mathematical Sciences, Univ. of Memphis)

Cycle Decompositions

The Alspach conjecture proposes necessary and sufficient conditions for a complete graph $K_n$ ($n$ odd) or a complete graph minus a 1-factor ($n$ even) to be decomposable as an edge-disjoint union of cycles of prescribed lengths. We discuss various results on this and some related problems. In particular we show that the obvious necessary conditions are sufficient if the cycle lengths are bounded by a linear function of the number of vertices $n$, or in general if we only require closed trails of prescribed lengths rather than cycles. We also describe some similar results for complete bipartite graphs, dense graphs, and complete digraphs.

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