Maximal and minimal coverings of (k - 1)-tuples by k-tuples

DOI10.2140/pjm.1968.26.131zbMath0182.02804OpenAlexW1979740464MaRDI QIDQ2535244

J. G. Kalbfleisch, Ralph G.Stanton

Publication date: 1968

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1968.26.131

zbMATH Keywords

combinatorics

Related Items

Mandatory representation designs, Certain recurrent and asymptotic estimates in the covering problem, An improvement on covering triples by quadruples, Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four, Maximal resolvable packings and minimal resolvable coverings of triples by quadruples, On the number of square classes of a field with finite stufe, Some simple consequences of coding theory for combinatorial problems of packings and coverings, Steiner quadruple systems - a survey, Minimal covering and maximal packing of (k-1)-subsets by k-subsets, On the covering of pairs by quadruples. I, The last packing number of quadruples, and cyclic SQS