The 3-way flower intersection problem for Steiner triple systems
From MaRDI portal
Publication:5130736
DOI10.23638/DMTCS-22-1-5zbMath1450.05004arXiv1908.06679MaRDI QIDQ5130736
Hanieh Amjadi, Nasrin Soltankhah
Publication date: 28 October 2020
Full work available at URL: https://arxiv.org/abs/1908.06679
Steiner triple systemgroup divisible designpairwise balanced designLatin square3-way intersection3-way flower intersection
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\)
- Balanced incomplete block designs and related designs
- Intersection numbers of Kirkman triple systems
- Small group-divisible designs with block size four
- On the existence of \(d\)-homogeneous \(\mu\)-way \((v, 3, 2)\) Steiner trades
- The flower intersection problem for Kirkman triple systems
- Group divisible designs with block sizes from \(K_{1(3)}\) and Kirkman frames of type \(h^u m^1\)
- The 3-way intersection problem for Kirkman triple systems
- Large sets of disjoint group-divisible designs with block size three and type 2n41
- Four Mutually Orthogonal Latin Squares of Order 14
- Some Results on the Maximum Number of STSs such that any Two of them Intersect in the same Block-Set
- Steiner Triple Systems Having a Prescribed Number of Triples in Common
- The 3-way intersection problem for S(2, 4, v) designs
- Intersections of Kirkman triple systems
- The three-way intersection problem for Latin squares
This page was built for publication: The 3-way flower intersection problem for Steiner triple systems