Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-12T15:00:59.369Z 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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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