The following pages link to A Note on Steiner Triple Systems. (Q3281087):
Displaying 14 items.
- Triples, current graphs and biembeddings (Q1054742) (← links)
- Cyclic block designs with block size 3 (Q1153917) (← links)
- Unendliche gefaserte Steinersysteme (Q1234908) (← links)
- Distribution of integers into k-tuples with prescribed conditions (Q1257015) (← links)
- Solving a conjecture of Sedlacek: Maximal edge sets in the 3-uniform sumset hypergraphs (Q1322279) (← links)
- A direct method to construct triple systems (Q1843436) (← links)
- Constructing partial geometries from overlarge sets of Steiner systems (Q2118350) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- Egalitarian Steiner triple systems for data popularity (Q2232127) (← links)
- On the Skolem method for the construction of cyclic systems of Steiner triples (Q2534285) (← links)
- Tests for nonisomorphic Steiner triple systems (Q2562086) (← links)
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage (Q3174717) (← links)
- On the toroidal thickness of graphs (Q3947683) (← links)
- On Additive Bases and Harmonious Graphs (Q3964614) (← links)
