Abstract
Block design games have been developed by Richardson (12) and by Hoffman and Richardson (8), who proved a number of theorems concerning such games by studying the number of elements in a blocking coalition. Hoffman and Richardson listed as unsolved (except for PG(2, 3)) the following problem: What is the minimum number of elements in a blocking coalition of a block design game?This note considers blocking coalitions in those games that are dual to block designs having λ = 1 and r — k > 0. For such games certain blocking coalitions are shown to be related to sets of mutually disjoint blocks in the design to which the game is dual. In particular, for Steiner triple systems the largest odd-numbered set of mutually disjoint triples is shown to yield a minimum blocking coalition in the dual.
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.
