On the difference between asymptotically good packings and coverings
type: Item
instance of: scholarly article
title: On the difference between asymptotically good packings and coverings
zbMATH Open document ID: 0819.05020
DOI: 10.1016/0195-6698(95)90087-X
published in: European Journal of Combinatorics
publication date: 1995-03-08T00:00:00Z
review text: It is proved that asymptotically ``good'' coverings of \(l\)-subsets of an \(n\)-set by \(k\)-subsets \((l< k< n)\) exist for \(k= o(n)\) and slowly increasing \(l\). Moreover, if \(l= o(k)\) then asymptotically good packings do not exist if \(k> c\sqrt n\) for some constant \(c> 1\), and do exist if \(k< e\sqrt n\) for some \(c< 1\).
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 731893
zbMATH Keywords: coverings
zbMATH Keywords: packings
author: N. N. Kuzyurin
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
Wikidata QID: Q105583540
cites work: Some simple consequences of coding theory for combinatorial problems of packings and coverings
cites work: Q5734432
cites work: Q4065548
cites work: Q3285920
cites work: Q4190660
cites work: Primes in short intervals
cites work: On a packing and covering problem
cites work: Q5522938
cites work: Asymptotically good coverings
cites work: Q3312151
description: scientific article; zbMATH DE number 731893