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, February 21, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Yury Person (FU Berlin)

Powers of Hamilton Cycles in Pseudorandom Graphs

We study sufficient conditions when a pseudorandom graph contains a kth power of a hamilton cycle (and thus a K_{k+1}-factor). In particular our results improve upon the known bounds for (n,d,\lambda) graphs, i.e. those d-regular graphs with n vertices, whose second largest eigenvalue (in absolute value) of the adjacency matrix is at most \lambda. In my talk I will give a motivation for study of the problems of this type and an outline of the proof. This is joint work with Peter Allen, Julia Böttcher, Hiep Han and Yoshiharu Kohayakawa.

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