On the spectrum of Steiner (v,k,t) trades (II)

Gray, Brenton D. and Ramsay, Colin (1999) On the spectrum of Steiner (v,k,t) trades (II). Graphs and Combinatorics, 15 4: 405-415. doi:10.1007/s003730050074


Author Gray, Brenton D.
Ramsay, Colin
Title On the spectrum of Steiner (v,k,t) trades (II)
Formatted title
On the spectrum of Steiner ( v, k, t ) trades (II)
Journal name Graphs and Combinatorics   Check publisher's open access policy
ISSN 0911-0119
1435-5914
Publication date 1999-12
Sub-type Article (original research)
DOI 10.1007/s003730050074
Volume 15
Issue 4
Start page 405
End page 415
Total pages 11
Place of publication Tokyo, Japan
Publisher Springer Japan KK
Collection year 1999
Language eng
Subject C1
780101 Mathematical sciences
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
Formatted abstract
A (v,k,t) trade T=T 1T 2 of volume m consists of two disjoint collections T 1 and T 2 each containing m blocks (k-subsets) such that each t-subset is contained in the same number of blocks in T 1 and T 2. If each t-subset occurs at most once in T 1, then T is called a Steiner (k,t) trade. In this paper, we continue our investigation of the spectrum S(k,2); that is, the set of allowable volumes of Steiner (k,t) trades when t=2. By using the concept of linked trades, we show that 2k+1∈S(k,2) precisely when k∈{3, 4, 7}.
© Springer-Verlag 1999
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 7 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 10 Jun 2008, 14:42:23 EST