The 3-GDDs of type $g^3u^2$

Authors

  • Charles J. Colbourn School of CIDSE, Arizona State University, Tempe, Arizona 85287-8809, U.S.A ROR
  • Melissa S. Keranen Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931-1295, U.S.A ROR
  • Donald L. Kreher Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931-1295, U.S.A ROR

Keywords:

Group divisible designs, Partial triple systems, Graph decomposition

Abstract

A 3-GDD of type ${g^3u^2}$ exists if and only if $g$ and $u$ have the same parity, $3$ divides $u$ and $u\leq 3g$.Such a 3-GDD of type ${g^3u^2}$ is equivalent to an edge decomposition of $K_{g,g,g,u,u}$ into triangles.

Downloads

Download data is not yet available.

Downloads

Published

2016-09-15

How to Cite

Colbourn, C. J., Keranen, M. S., & Kreher, D. L. (2016). The 3-GDDs of type $g^3u^2$. Journal of Algebra Combinatorics Discrete Structures and Applications, 3(3), 135–144. Retrieved from https://jacodesmath.com/index.php/jacodesmath/article/view/41

Issue

Vol. 3 Issue 3: September 2016

Section

Articles