Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 11, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Katarzyna Mieczkowska (Adam Mickiewicz University)
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.
Automatic MiSe System Software Version 1.4803M | admin login