Counting Steiner triple systems (Q1620862): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4171/176-1/22 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4242297125 / rank | |||
Normal rank | |||
Revision as of 18:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Steiner triple systems |
scientific article |
Statements
Counting Steiner triple systems (English)
0 references
14 November 2018
0 references
Summary: We prove a conjecture of \textit{R. M. Wilson} [Math. Z. 135, 303--313 (1974; Zbl 0264.05009)] on the number of Steiner triple systems. The proof illustrates our method of randomised algebraic construction, which we developed recently to resolve a question of Steiner from 1853 on the existence of combinatorial designs. For the entire collection see [Zbl 1396.00017].
0 references
randomised algebraic construction
0 references
