Covering triples by quadruples: an asymptotic solution

From MaRDI portal
Publication:1072560

DOI10.1016/0097-3165(86)90119-6zbMath0587.05022OpenAlexW1999217025MaRDI QIDQ1072560

B. George

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90119-6




Related Items (26)

On \(\lambda\)-covers of pairs by quintuples: \(v\) oddAn application of modified group divisible designsExistence of resolvable H-designs with group sizes 2, 3, 4 and 6What we know and what we do not know about Turán numbersOptimal constant weight codes over \(Z_k\) and generalized designsA new existence proof for Steiner quadruple systemsCoverings pairs by quintuples: The case v congruent to 3 (mod 4)Constructions of optimal two-dimensional optical orthogonal codes with AM-OPPW restriction for \(\lambda = 2\)Matroid Horn functionsThe existence of large set of symmetric partitioned incomplete latin squaresH-designs with the properties of resolvability or (1, 2)-resolvabilityOptimal constant weight covering codes and nonuniform group divisible 3-designs with block size fourIntersections and supports of quadruple systemsA completion of \(LS(2^n4^1)\)Maximal resolvable packings and minimal resolvable coverings of triples by quadruplesSupport sizes of threefold quadruple systemsNew coverings oft-sets with (t + 1)-setsSubdesigns in Steiner quadruple systemsLarge sets with multiplicityAn improvement on H designA class of group divisible 3-designs and their applicationsBounds on the sizes of constant weight covering codesConstructions of Strictlym-Cyclic and Semi-Cyclic H(m,n,4,3)Matchings and covers in hypergraphsThe fundamental construction for 3-designsThe number of repeated blocks in twofold triple systems



Cites Work


This page was built for publication: Covering triples by quadruples: an asymptotic solution