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, February 23, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Penny Haxell (University of Waterloo)

Stability for matchings in regular hypergraphs

We consider a hypergraph analogue of the basic fact that every regular bipartite graph has a perfect matching. A theorem of Aharoni implies that every regular tripartite hypergraph $H$ with $n$ vertics in each class has a matching of size at least $n/2$, and moreover this bound is tight. We prove a stability version of this statement, showing that if $H$ has matching number close to $n/2$ then it is correspondingly close in structure to the extremal configuration.

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