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 11, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Pascal Su

Hajnal-Szemerédi theorem, but without large independent sets

A classical result by Hajnal and Szemeredi states the minimal degree conditions necessary to guarantee for a graph to contain a Kr-factor. Namely any graph on n vertices, minimum degree \delta(G) > (r-1)n/r and r dividing n has a Kr-factor. This result is tight but the extremal examples are unique in that they have large independent sets and very dense bipartite graphs between these sets. We show that as soon as we move away and forbid these extremal examples, the necessary minimum degree changes.

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