Counting Steiner triple systems
From MaRDI portal
Publication:1620862
DOI10.4171/176-1/22zbMath1400.05036OpenAlexW4242297125MaRDI QIDQ1620862
Publication date: 14 November 2018
Full work available at URL: https://doi.org/10.4171/176-1/22
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05) Triple systems (05B07)
Related Items (2)
Cartesian lattice counting by the vertical 2-sum ⋮ Enumerating extensions of mutually orthogonal Latin squares
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a packing and covering problem
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- On tail probabilities for martingales
- Counting designs
- Asymptotic enumeration by degree sequence of graphs of high degree
- Signed hypergraph designs and diagonal forms for some incidence matrices
- Random triangle removal
- The module structure of integral designs
- 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
- Nonisomorphic Steiner triple systems
- An upper bound on the number of Steiner triple systems
- A hypergraph regularity method for generalized Turán problems
- Probabilistic existence of rigid combinatorial structures
This page was built for publication: Counting Steiner triple systems
