Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Tuesday, March 17, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Yves Brise

Disjoint Covering Number

Consider the following setup: You are given a ground set of size $n$, i.e. $[n] := \{0, \ldots, n-1\}$, and two parameters $k$ and $r$, $1\leq r \leq k \leq n$. A $(n,k,r)$ covering $C$ is a set of $k$-subsets of $[n]$ such that ALL $r$-subsets of $[n]$ are contained in some member of $C$.

The problem of finding a covering of small size has already been well studied. Instead, we are interested in determining the maximum number of disjoint coverings. A set of coverings is called disjoint, if the coverings are pairwise disjoint, i.e. any pair of them does not use the same $k$-subset twice.

Joint work with Bernd Gärtner.

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

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