Gregarious GDDs with Two Associate Classes

12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The existence of group divisible designs with two associate classes has been studied for over 50 years. Probably the most difficult cases to solve are those in which the number of groups is less than the size of the blocks. Recently, such an existence problem was solved in the case where the groups have the same size and the blocks have size 3. In this paper, we continue to focus on blocks of size 3, solving the existence problem when the required designs are gregarious (each block intersects each group). These designs are tight to construct in the sense that they satisfy equality in one of the bounds required for GDDs to exist. © 2010 Springer.

Cite

CITATION STYLE

APA

El-Zanati, S. I., Punnim, N., & Rodger, C. A. (2010). Gregarious GDDs with Two Associate Classes. Graphs and Combinatorics, 26(6), 775–780. https://doi.org/10.1007/s00373-010-0951-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free