Some Constructions of Steiner Triple Systems of Type v⟶2v + 1 + 6k
Open Access
- 2 March 2026
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 850
Abstract
A Steiner Triple System () of order v is a hypergraph that is uniform of rank 3 and has order v, such that every 2-subset of X has degree 1. In this paper, we present some constructions of of type and , examining all possible cases.
Keywords
This publication has 9 references indexed in Scilit:
- Some Problems and Conjectures About Voloshin Triple SystemsMathematics, 2025
- Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is EvenMathematics, 2022
- Uniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even nMathematics, 2020
- Cyclically decomposing the complete graph into cyclesDiscrete Mathematics, 2004
- Cyclic Hamiltonian cycle systems of the complete graphDiscrete Mathematics, 2004
- Cycle decompositions III: Complete graphs and fixed length cyclesJournal of Combinatorial Designs, 2001
- Cycle Decompositions of K and K−IJournal of Combinatorial Theory, Series B, 2001
- Triple Systems1999
- CRC Handbook of Combinatorial Designs1996