Counting Steiner triple systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 3448595 (Why is no real title available?)
- A hypergraph regularity method for generalized Turán problems
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- An upper bound on the number of Steiner triple systems
- Asymptotic enumeration by degree sequence of graphs of high degree
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Counting designs
- Nonisomorphic Steiner triple systems
- On a packing and covering problem
- On tail probabilities for martingales
- Probabilistic existence of rigid combinatorial structures
- Random triangle removal
- Signed hypergraph designs and diagonal forms for some incidence matrices
- The CRC handbook of combinatorial designs
- The early history of block designs
- The module structure of integral designs
Cited in
(9)- Enumerating Steiner triple systems
- scientific article; zbMATH DE number 1228449 (Why is no real title available?)
- Enumerating extensions of mutually orthogonal Latin squares
- Almost all Steiner triple systems have perfect matchings
- 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)
