Minimal coverings of pairs by triples

DOI10.2140/pjm.1958.8.709zbMath0084.01401OpenAlexW2017692621WikidataQ101082948 ScholiaQ101082948MaRDI QIDQ770291

Publication date: 1958

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

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

zbMATH Keywords

combinatorics

Related Items (55)

Coverings of a complete graph with five-vertex and five-edge graphs ⋮ On \(\lambda\)-covers of pairs by quintuples: \(v\) odd ⋮ An application of modified group divisible designs ⋮ Group divisible packings and coverings with any minimum leave and minimum excess ⋮ What we know and what we do not know about Turán numbers ⋮ Coverings of pairs by quintuples ⋮ Mandatory representation designs ⋮ Coverings pairs by quintuples: The case v congruent to 3 (mod 4) ⋮ Neighborhoods in Maximum Packings of 2K_nand Quadratic Leaves of Triple Systems ⋮ Unnamed Item ⋮ \(f\)-vectors of pure complexes and pure multicomplexes of rank three ⋮ Certain recurrent and asymptotic estimates in the covering problem ⋮ An improvement on covering triples by quadruples ⋮ Kite-group divisible packings and coverings with any minimum leave and minimum excess ⋮ Metric spaces in which many triangles are degenerate ⋮ Matroid Horn functions ⋮ Golden ratios in a pairs covering problem ⋮ Existence of \((v,\{5,w^*\},1)\)-PBDs. ⋮ Existence of incomplete resolvable minimum coverings of pairs by triples. ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ Bounds for the static permutation mastermind game ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ Singular points in pair covers and their relation to Hadamard designs ⋮ A subspace covering problem in the \(n\)-cube ⋮ Covering the complete graph with plane cycles ⋮ Asymptotic Bounds for General Covering Designs ⋮ Connected Covering Numbers ⋮ Unnamed Item ⋮ New coverings oft-sets with (t + 1)-sets ⋮ On the constructive enumeration of packings and coverings of index one ⋮ Some simple consequences of coding theory for combinatorial problems of packings and coverings ⋮ Balanced incomplete block designs and related designs ⋮ \(G\)-decomposition of \(K_n\), where G has four vertices or less ⋮ Linear spaces with small generated subspaces ⋮ Minimal covering and maximal packing of (k-1)-subsets by k-subsets ⋮ Bounds on the sizes of constant weight covering codes ⋮ Matchings and covers in hypergraphs ⋮ Group divisible designs with two associate classes: \(n=2\) or \(m=2\) ⋮ Covering graphs: The covering problem solved ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs ⋮ Graphs with forbidden subgraphs ⋮ Construction of quasigroups containing a specified number of subquasigroups of a given order ⋮ The lotto numbers L(n,3,p,2) ⋮ Existence of large sets of coverings with block size 3 ⋮ On the covering of pairs by quadruples. I ⋮ On the covering of pairs by quadruples. II ⋮ Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit ⋮ On the existence of triangulated spheres in 3-graphs, and related problems ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ On group divisible covering designs ⋮ Packing and covering of the complete graph with a graph G of four vertices or less ⋮ A method of constructing coverings ⋮ On the optimality of a class of minimal covering designs ⋮ Large sets of coverings ⋮ On small packing and covering designs with block size 4

This page was built for publication: Minimal coverings of pairs by triples