Constructing random Steiner triple systems: an experimental study

DOI10.1007/978-3-031-48679-1_9zbMATH Open1548.05051MaRDI QIDQ6613365

Daniel Heinlein, Patric R. J. Östergård

Publication date: 2 October 2024

zbMATH Keywords

random hypergraphsCameron's algorithmStinson's hill-climbing algorithm

Mathematics Subject Classification ID

Triple systems (05B07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pasch trades with a negative block
• Switching codes and designs
• Classification algorithms for codes and designs
• A generalisation of \(t\)-designs
• Random generation of combinatorial structures from a uniform distribution
• Research problems from the 18th British Combinatorial Conference
• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• Almost all Steiner triple systems have perfect matchings
• Generating uniformly distributed random latin squares
• Some new perfect Steiner triple systems
• The Steiner triple systems of order 19
• Convergence Rates for Markov Chains
• Hill‐climbing to Pasch valleys
• Algorithms and complexity for counting configurations in Steiner triple systems

This page was built for publication: Constructing random Steiner triple systems: an experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613365)