**Date & Time:** Tuesday, February 25, 2014, 13:45- 14:45.

**Venue:** Ramanujan Hall

**Title:** Almost Steiner Designs

**Speaker:** Niranjan Balachandran, IIT Bombay

**Abstract:** We shall see a result of Ferber, Hod, Krivelevich, and
Sudakov (2013) that shows that one can get almost Steiner designs in
the following sense:

- The number of 'blocks' is (1+o(1))\frac{\binom{v}{t}}{\binom{k}{t}}
- Evert t-subset is contained in at least one and at most two blocks.