| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421434 | Discrete Applied Mathematics | 2007 | 10 Pages |
Abstract
Different (proper as well as improper) simple games may share any nonseparating blocking family. An interesting question is whether all such proper games on one hand, and all improper ones on the other, are isomorphic. The answer is given here and the automorphisms of the blocking family help us to understand the structure and links of all such games.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Francesc Carreras,