Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The 3-way flower int ...
Article

The 3-way flower intersection problem for Steiner triple systems

H. Amjadi, N. Soltankhah ORCID
Download article
Open on arXiv
Submitted on
August 23, 2019
Accepted on
January 9, 2020
Published on
March 16, 2020
Last modified on
March 31, 2025
Volume 22
vol. 22:1
Combinatorics
DOI
10.23638/DMTCS-22-1-5
License
arXiv.org - Non-exclusive license to distribute
Indicators
1399
Views
932
Downloads

The 3-way flower intersection problem for Steiner triple systems

H. Amjadi, N. Soltankhah ORCID
Abstract
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}. Comment: 14 pages
Keywords
  • Mathematics - Combinatorics
  • 05B05
Mathematics Subject Classification 2020
  • 05B07 - Triple systems
Preview
Loading PDF preview...