On coverings

DOI10.2140/pjm.1964.14.1405zbMath0128.24501MaRDI QIDQ2394642

J. Schönheim

Publication date: 1964

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

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

zbMATH Keywords

combinatorics

Related Items

3‐(v, 4, 1) covering designs with chromatic numbers 2 and 3, Covering pairs by quintuples with index λ  0 (mod 4), New constructions for covering designs, Large sets of coverings, Pair covering and other designs with block size 6, Some simple consequences of coding theory for combinatorial problems of packings and coverings, Binary codes from rectangular lattice graphs and permutation decoding, Pair covering designs with block size 5, Lower bounds for coverings of pairs by large blocks, Permutation decoding for binary codes from lattice graphs, On some covering designs, Covering triples by quadruples: an asymptotic solution, On the covering of pairs by quadruples, Coverings of pairs by quintuples, Coverings pairs by quintuples: The case v congruent to 3 (mod 4), Certain recurrent and asymptotic estimates in the covering problem, The packing of pairs by quadruples, Singular points in pair covers and their relation to Hadamard designs, Balanced incomplete block designs and related designs, Steiner quadruple systems - a survey, Minimal covering and maximal packing of (k-1)-subsets by k-subsets, Covering graphs: The covering problem solved, General upper bounds on the minimum size of covering designs, On \(\lambda\)-covers of pairs by quintuples: \(v\) odd, On covering designs with block size 5 and index 5, Permutation decoding for the binary codes from triangular graphs., Existence of \((v,\{5,w^*\},1)\)-PBDs., Some \(t\)-designs are minimal \((t+1)\)-coverings, Partial permutation decoding for codes from finite planes, Bounds on the sizes of constant weight covering codes, Matchings and covers in hypergraphs, Puncture sets, What we know and what we do not know about Turán numbers, On the constructive enumeration of packings and coverings of index one, Information sets and partial permutation decoding for codes from finite geometries, On the covering of pairs by quadruples. I, On the covering of pairs by quadruples. II, Codes from the line graphs of complete multipartite graphs and PD-sets, Lotto design tables, An improvement on covering triples by quadruples, Constraint Orbital Branching, Unnamed Item, Unnamed Item