Article contents
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Published online by Cambridge University Press: 01 May 2000
Abstract
For any fixed l < k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomial in log n.
- Type
- Research Article
- Information
- Copyright
- 2000 Cambridge University Press
- 4
- Cited by