Certain recurrent and asymptotic estimates in the covering problem

DOI10.1007/BF01159545zbMath0436.05019OpenAlexW2020626213MaRDI QIDQ1140649

Nikolaj Nikolaevich Kuzyurin

Publication date: 1980

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01159545

zbMATH Keywords

n-dimensional cubeminimal coverings of L-tuples by K-tuples

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal coverings of pairs by triples
• A lower bound for v in a \(t-(v,k,\lambda)\) design
• On coverings
• Maximal and minimal coverings of (k - 1)-tuples by k-tuples
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• On Quadruple Systems
• The Existence and Construction of Balanced Incomplete Block Designs

This page was built for publication: Certain recurrent and asymptotic estimates in the covering problem