Geodesic
Class-uniformly resolvable group divisible structures. II: Frames
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partial resolution classes subject to the class-uniform condition. We derive the necessary conditions, including extremal bounds, build the foundation for general CURF constructions, including a frame variant of the $\lambda$ blow-up construction from part I. We also establish a PBD-closure result. For CURFs with blocks of size two and three we determine the existence of CURFs of type $g^u$, completely for $g=3$, with a small list of exceptions for $g=6$, asymptotically for $g=4,5$ and give some other infinite families.
DOI : 10.37236/1777
Classification : 05B05, 05B40
Mots-clés : group divisible designs 
@article{10_37236_1777,
     author = {Peter Danziger and Brett Stevens},
     title = {Class-uniformly resolvable group divisible structures. {II:} {Frames}},
     journal = {The electronic journal of combinatorics},
     year = {2004},
     volume = {11},
     number = {1},
     doi = {10.37236/1777},
     zbl = {1055.05011},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1777/}
}
TY  - JOUR
AU  - Peter Danziger
AU  - Brett Stevens
TI  - Class-uniformly resolvable group divisible structures. II: Frames
JO  - The electronic journal of combinatorics
PY  - 2004
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1777/
DO  - 10.37236/1777
ID  - 10_37236_1777
ER  - 
%0 Journal Article
%A Peter Danziger
%A Brett Stevens
%T Class-uniformly resolvable group divisible structures. II: Frames
%J The electronic journal of combinatorics
%D 2004
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1777/
%R 10.37236/1777
%F 10_37236_1777
Peter Danziger; Brett Stevens. Class-uniformly resolvable group divisible structures. II: Frames. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1777

Cité par Sources :