Minimal coverings of pairs by triples

Cited In (56)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770291)