Counting Steiner triple systems

DOI10.4171/176-1/22zbMATH Open1400.05036OpenAlexW4242297125MaRDI QIDQ1620862FDOQ1620862

Authors: Peter Keevash 

Publication date: 14 November 2018

Full work available at URL: https://doi.org/10.4171/176-1/22

Recommendations

• Counting designs
• scientific article; zbMATH DE number 4193681
• An upper bound on the number of Steiner triple systems
• scientific article; zbMATH DE number 5984452
• On sparse countably infinite Steiner triple systems

zbMATH Keywords

randomised algebraic construction

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Cites Work

• On tail probabilities for martingales
• The CRC handbook of combinatorial designs
• On a packing and covering problem
• Counting designs
• An upper bound on the number of Steiner triple systems
• Title not available (Why is that?)
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Probabilistic existence of rigid combinatorial structures
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Nonisomorphic Steiner triple systems
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• The module structure of integral designs
• Title not available (Why is that?)
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• A hypergraph regularity method for generalized Turán problems
• Random triangle removal
• Signed hypergraph designs and diagonal forms for some incidence matrices
• The early history of block designs

Cited In (9)

• Enumerating Steiner triple systems
• Title not available (Why is that?)
• Almost all Steiner triple systems have perfect matchings
• Enumerating extensions of mutually orthogonal Latin squares
• Cartesian lattice counting by the vertical 2-sum
• Counting designs
• An upper bound on the number of Steiner triple systems
• On the Wilson monoid of a pairwise balanced design
• Interview with Joel Spencer

This page was built for publication: Counting Steiner triple systems

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