arXiv:1908.06679 [math.CO]AbstractReferencesReviewsResources
The 3-way flower intersection problem for Steiner triple systems
Published 2019-08-19Version 1
The flower at a point x in a Steiner triple system (X; B) is the set of all triples containing x. Denote by J3F(r) the set of all integers k such that there exists a collection of three STS(2r+1) mutually intersecting in the same set of k + r triples, r of them being the triples of a common flower. In this article we determine the set J3F(r) for any positive integer r = 0, 1 (mod 3) (only some cases are left undecided for r = 6, 7, 9, 24), and establish that J3F(r) = I3F(r) for r = 0, 1 (mod 3) where I3F(r) = {0, 1,..., 2r(r-1)/3-8, 2r(r-1)/3-6, 2r(r-1)/3}.
Related articles: Most relevant | Search more
arXiv:1611.10239 [math.CO] (Published 2016-11-30)
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
arXiv:1512.01008 [math.CO] (Published 2015-12-03)
On Ratio Monotonicity of a New Kind of Numbers Conjectured by Z.-W. Sun
arXiv:math/0406053 [math.CO] (Published 2004-06-03)
A Note on Graph Pebbling