2025/11/06 by Bonacini, Paola, Gionfriddo, Mario, Marino, Lucia
Engineering · Mathematics · #graph theory and CDMA systems #Limits and Structures in Graph Theory #Finite Group Theory Research
paper · doi:10.48550/arxiv.2511.04823
A Steiner Triple System (STS) of order v is a hypergraph uniform of rank 3, with v vertices and such that every 2-subset of vertices has degree 1. In this paper we give a construction, by difference method, of type v\longrightarrow 2v+7 with v=2n-7, which means that, given an STS of order v=2n -7, it is always possible to construct an STS of order 2n+1-7. Through this construction it is possible to get for any n≥ 5 an STS(2n-7) with a maximal independent set of maximal cardinality and which is (n-1)-bicolorable.