On the covering of pairs by quadruples. II

From MaRDI portal
Publication:2560414

DOI10.1016/S0097-3165(73)80003-2zbMath0261.05022OpenAlexW1984221099MaRDI QIDQ2560414

Yanyan Li

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(73)80003-2




Related Items (26)

Coverings of a complete graph with five-vertex and five-edge graphsOn the covering of pairs by quadruplesOn \(\lambda\)-covers of pairs by quintuples: \(v\) oddAn application of modified group divisible designsWhat we know and what we do not know about Turán numbersCoverings of pairs by quintuplesCoverings pairs by quintuples: The case v congruent to 3 (mod 4)Certain recurrent and asymptotic estimates in the covering problemKite-group divisible packings and coverings with any minimum leave and minimum excessExtended (2,4)-designsThe packing of pairs by quadruplesSingular points in pair covers and their relation to Hadamard designsA subspace covering problem in the \(n\)-cubeAsymptotic Bounds for General Covering DesignsMinimal covering and maximal packing of (k-1)-subsets by k-subsetsExistence of \((v,K_{1(3)}\cup\{w^*\})\)-PBDs and its applicationsOptimal packings of \(K_4\)'s into a \(K_n\)Matchings and covers in hypergraphsCovering graphs: The covering problem solvedSimple minimum (\(K_4 - e\))-coverings of complete multipartite graphsConstructions of optimal packing and covering of the complete multigraph with applicationsGroup Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row LimitPacking and covering of the complete graph with a graph G of four vertices or lessA method of constructing coveringsSome recent developments on BIBDs and related designsOn small packing and covering designs with block size 4



Cites Work


This page was built for publication: On the covering of pairs by quadruples. II