Hostname: page-component-76c49bb84f-xk4dl Total loading time: 0 Render date: 2025-07-12T23:50:46.259Z Has data issue: false hasContentIssue false
  • English
  • Français

Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings

Published online by Cambridge University Press:  01 May 2000

N. N. KUZJURIN
N. N. KUZJURIN
Affiliation:
Institute for System Programming, Russian Academy of Sciences, B. Kommunisticheskaya, 25, 109004 Moscow, Russia (e-mail: nnkuz@ispras.ru)
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 3 , May 2000 , pp. 265 - 276
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable