A Note on Steiner Triple Systems.
From MaRDI portal
Cited in
(16)- Triples, current graphs and biembeddings
- Cyclic block designs with block size 3
- Unendliche gefaserte Steinersysteme
- Distribution of integers into k-tuples with prescribed conditions
- Solving a conjecture of Sedlacek: Maximal edge sets in the 3-uniform sumset hypergraphs
- A direct method to construct triple systems
- Constructing partial geometries from overlarge sets of Steiner systems
- Access balancing in storage systems by labeling partial Steiner systems
- Egalitarian Steiner triple systems for data popularity
- On the Skolem method for the construction of cyclic systems of Steiner triples
- Tests for nonisomorphic Steiner triple systems
- MaxMinSum Steiner systems for access balancing in distributed storage
- On the toroidal thickness of graphs
- On Additive Bases and Harmonious Graphs
- A random Hall-Paige conjecture
- Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
This page was built for publication: A Note on Steiner Triple Systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3281087)
