Abstract
It is proved in this paper that an RGD(3, g;v) can be embedded in an RGD(3, g;u) if and only if \(u-g\equiv v-g\equiv 0 (mod 2)\), \(u\equiv v\equiv 0 (mod 3)\), \(u\equiv v\equiv 0 (mod g)\), v ≥ 3g, u ≥ 3v, and (g,v) ≠ (2,6),(2,12),(6,18).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assaf AM, Hartman A (1989) Resolvable group divisible designs with block size 3. Discrete Math 77:5–20
Colbourn CJ, Dinitz JH (eds) (1996) Handbook of combinatorial designs, CRC Press, Boca Raton, Florida 1996. (New results are reported at http://www.emba.uvm.edu/~dinitz/hcd.html).
Deng D, Rees R, Shen H (2003) On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12. Discrete Math 261:209–233
Deng D, Rees R, Shen H (2003) Further results on nearly Kirkman triple systems with subsystems. Discrete Math 270:99–114
Deng D, Rees R, Shen H (2006) On the existence of nearly Kirkman triple systems with subsystems. Discrete math, accepted
Furino SC, Miao Y, Yin JX (1996) Frame and resolvable designs: uses, constructions and Existence. CRC Press, Boca Raton, Florida
Ge G, Lam CWH (2003) Resolvable group divisible designs with block size four and group size six. Discrete Math 268:139–151
Ge G, Lam CWH, Ling ACH, Shen H (2005) Resolvable maximum packings with quadruples. Design Code Cryptogr 35:287–302
Ge G, Ling ACH (2004) A survey on resolvable group divisible designs with block size four. Discrete Math 279:225–245
Ge G, Rees R (2004) On group-divisible designs with block size four and group-type 6u m 1. Discrete Math. 279:247–265
Ge G, Rees R (2002) On group-divisible designs with block size four and group-type g u m 1. Design Code Cryptogr 27:5–24
Mendelsohn E, Shen H (1987) A construction of resolvable group divisible designs with block size 3. Ars Combin 24:39–43
Rees R (1993) Two new direct product-type constructions for resolvable group divisible designs. J Combin Design 1:15–26
Rees R, Stinson DR (1987) On resolvable group-divisible desings with block size three. Ars Combin 23:107–120
Rees R, Stinson DR (1988) On the existence of Kirkman triple systems containing Kirkman subsystems. Ars Combin 26:3–16
Rees R, Stinson DR (1988) Kirkman triple systems with maximum subsystems. Ars Combin 25:125-132
Shen H (1990) Constructions and uses of labeled resolvable designs. In: Wallis WD (eds) Combinatorial designs and applications. Marcel Dekker, New York, pp 97–107
Shen H (1992) Embeddings of simple triple systems. Sci China Ser A 35:283–291
Stinson DR (1987) Frames for Kirkman triple systems Discrete Math 65:289–300
Tang S, Shen H (2001) Embeddings of nearly Kirkman triple systems. J Stat Plann Infer 94:327–333
Wang J, Shen H (2006) Existence of (v, k 1(3) U {w k})-PDs and its applications, submitted
Author information
Authors and Affiliations
Corresponding author
Additional information
communicated by J.D. Key.
Rights and permissions
About this article
Cite this article
Shen, J., Shen, H. Embeddings of resolvable group divisible designs with block size 3. Des Codes Crypt 41, 269–298 (2006). https://doi.org/10.1007/s10623-006-9010-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-006-9010-0