An Upper bound on the number of Steiner triple systems
Abstract
Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e2))(n2/6) F(n) <= ((1 + o(1)) (n/e2))(n2/2) We conjecture that the bound is sharp. Our main tool is the entropy method.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.