Popularity Block Labelling for Steiner Systems

Author(s):  
Charles J. Colbourn
Keyword(s):  
1973 ◽  
Vol 15 (3) ◽  
pp. 347-350 ◽  
Author(s):  
Shmuel Schreiber
Keyword(s):  

1990 ◽  
Vol 19 (3) ◽  
pp. 481-493
Author(s):  
Mitsuo YOSHIZAWA
Keyword(s):  

2014 ◽  
Vol 22 (1) ◽  
pp. 189-205 ◽  
Author(s):  
Antonio Maturo ◽  
Fabrizio Maturo

AbstractSome relations between finite geometric spaces and cooperative games are considered. The games associated to Steiner systems, in particular projective and affine planes, are considered. The properties of winning and blocking coalitions are investigated.


1981 ◽  
Vol 33 (6) ◽  
pp. 1365-1369 ◽  
Author(s):  
K. T. Phelps

A Steiner system S(t, k, v) is a pair (P, B) where P is a v-set and B is a collection of k-subsets of P (usually called blocks) such that every t-subset of P is contained in exactly one block of B. As is well known, associated with each point x ∈ P is a S(t � 1, k � 1, v � 1) defined on the set Px = P\{x} with blocksB(x) = {b\{x}|x ∈ b and b ∈ B}.The Steiner system (Px, B(x)) is said to be derived from (P, B) and is called (obviously) a derived Steiner (t – 1, k – 1)-system. Very little is known about derived Steiner systems despite much effort (cf. [11]). It is not even known whether every Steiner triple system is derived.Steiner systems are closely connected to equational classes of algebras (see [7]) for certain values of k.


1987 ◽  
Vol 303 (1) ◽  
pp. 183-183 ◽  
Author(s):  
Jaroslav Nešetřil ◽  
Vojtěch R{ödl
Keyword(s):  

Design Theory ◽  
2009 ◽  
pp. 177-200
Keyword(s):  

2003 ◽  
Vol 11 (3) ◽  
pp. 153-161
Author(s):  
Alice Devillers
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document