Existence results for near resolvable designs

DOI10.1002/JCD.3180030204zbMATH Open0885.05023OpenAlexW2044960725MaRDI QIDQ4373385FDOQ4373385

Authors: Steven Furino 

Publication date: 15 April 1998

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180030204

Recommendations

• The existence of NRB[v,k] wherek + 1 is an even prime power
• Some new near resolvable BIBDs with \(k=7\) and resolvable BIBDs with \(k=5\)
• Enumeration of all \((2k+1,k,k-1)\)-NRBIBDs for \(3\leq k\leq 13\)
• scientific article; zbMATH DE number 3904599

zbMATH Keywords

balanced incomplete block designgroup divisible designnear resolvable design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• Cyclotomy and difference families in elementary Abelian groups
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Title not available (Why is that?)

Cited In (11)

• Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• Two existence results between an affine resolvable SRGD design and a difference scheme
• Enumeration of all \((2k+1,k,k-1)\)-NRBIBDs for \(3\leq k\leq 13\)
• On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.
• Decompositions of edge-colored complete graphs
• Constructions for rotational near resolvable block designs
• Title not available (Why is that?)
• Existence of near resolvable \((v,k,k-1)\) BIBDs with \(k\in\{9,12,16\}\)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Existence results for near resolvable designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373385)