The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
From MaRDI portal
Publication:914681
DOI10.1016/0012-365X(90)90066-QzbMath0702.05012OpenAlexW2043819374WikidataQ114215627 ScholiaQ114215627MaRDI QIDQ914681
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90066-q
Related Items (5)
Linear spaces with many small lines ⋮ Frames and the \(g^{(k)}(v)\) problem ⋮ The spectrum of restricted resolvable designs with \(r=2\) ⋮ Nesting directed cycle systems of even length ⋮ On the partition and coloring of a graph by cliques
Cites Work
- On the number of blocks in a perfect covering of v points
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
- Minimal clique partitions and pairwise balanced designs
- Frames for Kirkman triple systems
- Frames and the \(g^{(k)}(v)\) problem
- On balanced incomplete block designs with blocks having five elements
- On resolvable designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
