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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 27, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Wojciech Samotij (Tel Aviv University)

Subsets of posets minimising the number of chains

A well-known theorem of Sperner describes the largest collections of subsets of an n-element set none of which contains another set from the collection. Generalising this result, Erdős characterised the largest families of subsets that do not contain a chain of sets of an arbitrary length k. The extremal families contain all subsets whose cardinalities belong to an interval of length k–1 centred around n/2. In a far-reaching extension of Sperner's theorem, Kleitman determined the smallest number of chains of length two that have to appear in a collection of a given number a of subsets. For every a, this minimum is achieved by the collection comprising a sets whose cardinalities are as close to n/2+1/4 as possible. Kleitman conjectured that the same is true about chains of an arbitrary length k, for all a and n. We will sketch a proof of this conjecture.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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