Simple signed Steiner triple systems
Combinatorics
2011-11-15 v2
Abstract
Let be a -set, a set of 3-subsets (triples) of , and a partition of with . The pair is called a simple signed Steiner triple system, denoted by ST, if the number of occurrences of every 2-subset of in triples is one more than the number of occurrences in triples . In this paper we prove that exists if and only if , , and , where and for , .
Cite
@article{arxiv.1105.2896,
title = {Simple signed Steiner triple systems},
author = {E. Ghorbani and G. B. Khosrovshahi},
journal= {arXiv preprint arXiv:1105.2896},
year = {2011}
}
Comments
11 pages, 1 table. Final version. To appear in Journal of Combinatorial Designs