Uniformly resolvable pairwise balanced designs with blocksizes two and three

From MaRDI portal
Revision as of 03:19, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1112035

DOI10.1016/0097-3165(87)90015-XzbMath0659.05016MaRDI QIDQ1112035

R. S. Rees

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)




Related Items (32)

Some more uniformly resolvable designs with block sizes 2 and 4Linear spaces with many small linesUniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphsPartial Steiner triple systems with equal-sized holesOn uniformly resolvable designs with block sizes 3 and 4Frames and the \(g^{(k)}(v)\) problemMandatory representation designsUnnamed ItemOn the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kitesUniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphsUniformly resolvable designs with block sizes 3 and 4Unnamed ItemThe existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)On resolvable mixed path designsCombinatorial constructions for optimal supersaturated designs.The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\)Resolvable 3-star designsClass-uniformly resolvable pairwise balanced designs with block size two and threeA new class of group divisible designs with block size threeSmall Uniformly Resolvable Designs for Block Sizes 3 and 4The Hamilton-Waterloo problem for cycle sizes 3 and 4A pair of disjoint 3-gdds of type \(g^{t} u^{1}\)Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four verticesUnnamed ItemOn vector space partitions and uniformly resolvable designsGroup divisible designs with two associate classes: \(n=2\) or \(m=2\)Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size fiveExistence of holey 3-GDDs of type \((u,g^t w^1)\)Unnamed ItemComplex uniformly resolvable decompositions of K_vFactorizations of complete graphs into cycles and 1-factorsMaximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles



Cites Work


This page was built for publication: Uniformly resolvable pairwise balanced designs with blocksizes two and three