Counting Steiner Triple Systems
Peter Keevash
University of Oxford, UK
A subscription is required to access this book chapter.
Abstract
We prove a conjecture of Wilson from 1974 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.