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, April 23, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Benny Sudakov (UCLA)

Triangle packings and 1-factors in oriented graphs

An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this talk we show that any oriented graph $G$ on $n$ vertices with minimum indegree and outdegree at least $(1/2-o(1))n$ contains a packing of cyclic triangles covering all but at most 3 vertices. This is best possible and almost answers an open question of Cuckler and Yuster. Under the same hypotheses, we also show that one can embed any prescribed almost 1-factor in $G$.

Joint work with P. Keevash.

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