Constructing random Steiner triple systems: an experimental study
From MaRDI portal
Recommendations
Cites work
- 2-(v,k,) designs of small order
- A generalisation of \(t\)-designs
- Algorithms and complexity for counting configurations in Steiner triple systems
- Almost all Steiner triple systems have perfect matchings
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
- Classification algorithms for codes and designs
- Convergence Rates for Markov Chains
- Generating uniformly distributed random latin squares
- Hill‐climbing to Pasch valleys
- scientific article; zbMATH DE number 5130670 (Why is no real title available?)
- scientific article; zbMATH DE number 3948279 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- Pasch trades with a negative block
- Random generation of combinatorial structures from a uniform distribution
- Research problems from the 18th British Combinatorial Conference
- Some new perfect Steiner triple systems
- Switching codes and designs
- The Steiner triple systems of order 19
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)
