# Noon lecture

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | future lectures)

On 05.06.2012 at 12:20 in S8, there is the following noon lecture:

# Supersaturation in the Boolean Lattice

## Jerrold R. Griggs

## University of South Carolina

## Abstract

(joint work with J.S.Sereni and Ross Kang)

If one has a collection F of subsets of the n-set [n], one can ask how many pairs of subsets A, B ("edges") must there be in F with A contained in B? We show that if |F|=C(n,n/2) +x, then there are at least xf edges, where f is \lceil (n+1)/2 \rceil, which is best-possible for small x. We are trying to solve the problem for general |F| of minimizing the number of edges in F. This would then recover a result of Kleitman(1966) that proves a conjecture of Erdos and Katona, and we hope to prove its generalization proposed by Kleitman.

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | future lectures)

Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010