Zero-sum flows for Steiner triple systems
Combinatorics
2015-05-13 v2
Abstract
Given a - design, , a {\it zero-sum -flow} of is a map such that for any point , the sum of around all the blocks incident with is zero. It has been conjectured that every Steiner triple system, STS, on points admits a zero-sum -flow. We show that for every pair , for which a triple system, TS exists, there exists one which has a zero-sum -flow, except when and except possibly when and . We also give a bound on and a recursive result which shows that every STS with a zero-sum -flow can be embedded in an STS with a zero-sum -flow if , a zero-sum -flow if and with a zero-sum -flow if .
Keywords
Cite
@article{arxiv.1502.04096,
title = {Zero-sum flows for Steiner triple systems},
author = {S. Akbari and A. C. Burgess and P. Danziger and E. Mendelsohn},
journal= {arXiv preprint arXiv:1502.04096},
year = {2015}
}
Comments
21 pages