Maximal Resolvable Packings and Minimal Resolvable Coverings of Triples by Quadruples
نویسندگان
چکیده
Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order v (MRPQS(v)) and minimal resolvable coverings of triples by quadruples of order v (MRCQS(v)). We show that an MRPQS(v) (MRCQS(v)) with the number of blocks meeting the upper (lower) bound exists if and only if v≡0 (mod 4). As a byproduct, we also show that a uniformly resolvable Steiner system URS(3,{4,6},{r4,r6},v) with r6≤1 exists if and only if v≡0 (mod 4). All of these results are obtained by the approach of establishing a new existence result on RH(62n) for all n≥2. q 2009 Wiley Periodicals, Inc. J Combin Designs 18: 209–223, 201
منابع مشابه
Constructions of uniform designs by using resolvable packings and coverings
In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.
متن کاملExistence of incomplete resolvable minimum coverings of pairs by triples
For given positive integers u and v with u ≡ v ≡ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u¿ 3v. c © 2003 Elsevier B.V. All rights reserved.
متن کاملPackings and coverings of v=3m+1 points with near-triangle factors
We determine, for each v == 1 mod 3, the maximum (resp. minimum) number of near-triangle factors possible on v points so that each pair of distinct points occurs in a triple in at most (resp. at least) one of the neartriangle factors. In particular, we show that for each v == 1 mod 3, v:/: 7, there exists a near-resolvable exact 2-covering of v points by triples whose near-triangle factors admi...
متن کاملAlmost resolvable minimum coverings of complete graphs with 4-cycles
If the complete graph Kn has vertex set X, a minimum covering of Kn with 4-cycles, (X,C, P ), is a partition of the edges of Kn ∪ P into a collection C of 4-cycles, where P is a subgraph of λKn and the number of edges in P is as small as possible. An almost parallel class of a minimum covering of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with n/4 4-cycles...
متن کاملResolvable packings R̃ MP ( 3 , 2 ; n , n − 3 ) and coverings R̃ MC ( 3 , 2 ; n , n − 2 )
Letn ≡ k−1, 0 or 1 (mod k).An R̃MP(k, ; n,m) (resp. R̃MC(k, ; n,m)) is a resolvable packing (resp. covering)withmaximum (resp. minimum) possible number m of parallel classes which are mutually distinct, each parallel class consists of (n− k + 1)/k blocks of size k and one block of size n− k (n− k+ 1)/k , and its leave (resp. excess) is a simple graph. Such designs can be used to construct certain...
متن کامل