On the difference between asymptotically good packings and coverings (Q1345524): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nikolaj Nikolaevich Kuzyurin / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105583540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple consequences of coding theory for combinatorial problems of packings and coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primes in short intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312151 / rank
 
Normal rank

Latest revision as of 12:14, 23 May 2024

scientific article
Language Label Description Also known as
English
On the difference between asymptotically good packings and coverings
scientific article

    Statements

    On the difference between asymptotically good packings and coverings (English)
    0 references
    8 March 1995
    0 references
    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\).
    0 references
    0 references
    coverings
    0 references
    packings
    0 references
    0 references