
arXiv: 1105.2896
AbstractLetXbe av‐set,be a set of 3‐subsets (triples) ofX, andbe a partition ofwith. The pairis called a simple signed Steiner triple system, denoted by ST, if the number of occurrences of every 2‐subset ofXin triplesis one more than the number of occurrences in triples. In this paper, we prove thatexists if and only if,, and, whereand for,. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 332–343, 2012
Triple systems, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05B07, 05B05, trade, simple signed Steiner triple system
Triple systems, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05B07, 05B05, trade, simple signed Steiner triple system
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
