Uniformly resolvable pairwise balanced designs with blocksizes two and three
From MaRDI portal
Publication:1112035
DOI10.1016/0097-3165(87)90015-XzbMath0659.05016MaRDI QIDQ1112035
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 4 ⋮ Linear spaces with many small lines ⋮ Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs ⋮ Partial Steiner triple systems with equal-sized holes ⋮ On uniformly resolvable designs with block sizes 3 and 4 ⋮ Frames and the \(g^{(k)}(v)\) problem ⋮ Mandatory representation designs ⋮ Unnamed Item ⋮ On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Uniformly resolvable designs with block sizes 3 and 4 ⋮ Unnamed Item ⋮ The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) ⋮ On resolvable mixed path designs ⋮ Combinatorial constructions for optimal supersaturated designs. ⋮ The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\) ⋮ Resolvable 3-star designs ⋮ Class-uniformly resolvable pairwise balanced designs with block size two and three ⋮ A new class of group divisible designs with block size three ⋮ Small Uniformly Resolvable Designs for Block Sizes 3 and 4 ⋮ The Hamilton-Waterloo problem for cycle sizes 3 and 4 ⋮ A pair of disjoint 3-gdds of type \(g^{t} u^{1}\) ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ Unnamed Item ⋮ On vector space partitions and uniformly resolvable designs ⋮ Group 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 five ⋮ Existence of holey 3-GDDs of type \((u,g^t w^1)\) ⋮ Unnamed Item ⋮ Complex uniformly resolvable decompositions of K_v ⋮ Factorizations of complete graphs into cycles and 1-factors ⋮ Maximum 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