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

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Katarzyna Mieczkowska (Adam Mickiewicz University)

On Erdos' conjecture on matchings in hypergraphs

In 1959 Erdos and Gallai determined the minimum number of edges in a graph, which guarantees the existence of a matching of a given size. A few years later the following more general question was raised: what is the maximum possible number of edges in a k-uniform hypergraph on n vertices in which the largest matching has s edges. In 1965 Erdos conjectured that the optimal case is when the hypergraph is either a clique, or the complement of a clique. Erdos' claim has not been verified so far and has been confirmed only for a handful of special cases. In the talk we survey recent results on Erdos' conjecture and comment on some other related problems.

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