This page contains new results in the area of combinatorial designs that have occurred since the publication of the Handbook of Combinatorial Designs, Second Edition in November 2006. The results here would be contained in Part IV of the Handbook.
Last edited 4/13/2022
Page 250, Table 3.23. {114, 150, 159, 183, 195, 210} \subset B({4,7,9}). H. Wei and G. Ge. Discr. Math. 313, 2065-2083 (2013).
Page 251, Table 3.23. Since 150 \in B({4,7,9}), it follows that 150 \in B({4,7,8,9}).
Page 251, Table 3.23. {247, 267} \subset B({5,6,8}). H. Yu, X. Sun, D. Wu and R.J.R. Abel, J. Combin. Des. 27 (2019), 27-41.
Page 251, Table 3.23. 263 \in B({5,7}), H. Yu, X. Sun, D. Wu and R.J.R. Abel, J. Combin. Des. 27 (2019), 27-41.
Page 252, Table 3.23. 198 \in B({5,6,9}), R.J.R. Abel and F.E. Bennett, J. Combin. Des. 13 (2005), 239-267. Also {190, 211} \subset B({5,7,8}) H. Yu, X. Sun, D. Wu and R.J.R. Abel, J. Combin. Des. 27 (2019), 27-41.
Page 256, Theorem 4.5. This theorem is now a special case of the following theorem: Let u, v and x be positive integers with v ≤ u. Then a 3-GDD of type u1 v1 1x exists if and only if u, v and x are odd, uv+ux+vx+\binom{x}{2} ≡ 0 (mod 3), and x ≥ u. This result appears in Darryn Bryant and Daniel Horsley, Steiner triple systems with two disjoint subsystems, J. Combin. Des., 14, 14-24 (2006). Darryn Bryant (db@maths.uq.edu.au) Sept. 2007.
Page 257, Table 4.10. The three unsolved orders in this table have all been found. An example of a 4-GDD of type 2354 and of type 35 62 is given in the following reference: R. Julian R. Abel, Yudhistira A. Bunjamin and Diana Combe, Some new group divisible designs with block size 4 and two or three group sizes, J. Combin. Des. 28 (2020), 614–628 10.1002/jcd.21719. An example of a 4-GDD of type 22 55 is given in the following reference: R. Julian R. Abel, Thomas Britz, Yudhistira A. Bunjamin and Diana Combe, Group divisible designs with block size 4 and group sizes 2 and 5, J. Combin. Des. 30 (2022), 367–383. 10.1002/jcd.21830. Yudhi Bunjamin (Yudhi@unsw.edu.au) April 2022.
Page 260, Theorem 4.32. The four possible exceptions with m = 3 and λ = 1, namely (n,t) \in {(6,14), (6,15), (6,18), (6,23)}, were constructed directly by Cao, Wang and Wei. The result appears in H. Cao, L. Wang, R. Wei, The existence of HGDDs with block size four and its application to double frames, Discrete Mathematics, Volume 309, Issue 4 (2009), Pages 945-949. Fei Gao (feigao.chn@gmail.com), March 2010.
Page 265, Theorem 5.44. The 4-RGDD of type 1227 was found in Theorem 2.1 of X. Sun and G. Ge, “Resolvable group divisible designs with block size four and general index,” Discrete Math. 309, pp. 2982-2989, 2009. http://dx.doi.org/10.1016/j.disc.2008.07.029. Fei Gao (feigao.chn@gmail.com), August 2010.
Page 265, Theorem 5.44. 4-RGDD of types 2142 , 2346, 654 and 2423 were found in E. Schuster and G. Ge, “On uniformly resolvable designs with block sizes 3 and 4”, Des. Codes Cryptogr., 57, pp 45 — 69, 2010. http://dx.doi.org/10.1007/s10623-009-9348-1. Fei Gao (feigao.chn@gmail.com), August 2010.
Page 265, Theorem 5.45. The {4,3}-RGDD of type 254 was found in Theorem 2.2 of X. Sun and G. Ge, “Resolvable group divisible designs with block size four and general index,” Discrete Math. 309, pp. 2982-2989, 2009. http://dx.doi.org/10.1016/j.disc.2008.07.029. Fei Gao (feigao.chn@gmail.com), August 2010.
Return to the HCD new results home page.