Abstract
summaryThis paper draws together bounds for the efficiency factor of block designs, starting with the papers of Conniffe & Stone (1974) and Williams & Patterson (1977). By extending the methods of Jarrett (1983), firstly to cover supercomplete block designs and then to cover resolvable designs, a set of bounds is obtained which provides the best current bounds for any block design with equal replication and equal block size, including resolvable designs and two‐replicate resolvable designs as special cases. The bounds given for non‐resolvable designs apply strictly only to designs which are either regular‐graph (John & Mitchell, 1977) or whose duals are regular‐graph. It is conjectured (John & Williams, 1982) that they are in fact global bounds. Similar qualifications apply to the bounds for resolvable designs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
