Constructing Random Steiner Triple Systems: An Experimental Study

Daniel Heinlein, Patric Östergård

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Abstract

Several methods for generating random Steiner triple systems (STSs)
have been proposed in the literature, such as Stinson’s hill-climbing
algorithm and Cameron’s algorithm, but these are not yet completely
understood. Those algorithms, as well as some variants, are here
assessed for STSs of both small and large orders. For large orders,
the number of occurrences of certain configurations in the constructed
STSs are compared with the corresponding expected values of random
hypergraphs. Modifications of the algorithms are proposed.
Original languageEnglish
Title of host publicationNew Advances in Designs, Codes and Cryptography
PublisherSpringer
Number of pages24
ISBN (Electronic)978-3-031-48679-1
ISBN (Print)978-3-031-48678-4
DOIs
Publication statusE-pub ahead of print - 16 Nov 2023
MoE publication typeA3 Book section, Chapters in research books

Fingerprint

Dive into the research topics of 'Constructing Random Steiner Triple Systems: An Experimental Study'. Together they form a unique fingerprint.

Cite this