Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T16:09:55.935Z Has data issue: false hasContentIssue false

On a Restricted Class of Block Design Games

Published online by Cambridge University Press:  20 November 2018

Jane W. Di Paola*
Affiliation:
The City University of New York
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966