Asymptotic existence of egalitarian Steiner 2-designs
From MaRDI portal
Publication:6613360
Recommendations
- Egalitarian Steiner quadruple systems of doubly even order
- Egalitarian Steiner triple systems for data popularity
- Access balancing in storage systems by labeling partial Steiner systems
- Kirkman systems that attain the upper bound on the minimum block sum, for access balancing in distributed storage
- MaxMinSum Steiner systems for access balancing in distributed storage
Cites work
- scientific article; zbMATH DE number 1342086 (Why is no real title available?)
- A second infinite family of Steiner triple systems without almost parallel classes
- Access balancing in storage systems by labeling partial Steiner systems
- Block-avoiding sequencings of points in Steiner triple systems
- Block‐avoiding point sequencings
- Combinatorial Designs
- Decompositions of edge-colored complete graphs
- Egalitarian Steiner quadruple systems of doubly even order
- Egalitarian Steiner triple systems for data popularity
- Egalitarian edge orderings of complete graphs
- Frame difference families and resolvable balanced incomplete block designs
- MaxMinSum Steiner systems for access balancing in distributed storage
- Maximal arcs in Steiner systems \(S(2,4,v)\)
- On independent sets in hypergraphs
- On partial parallel classes in partial Steiner triple systems
- Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage
- Optimal and pessimal orderings of Steiner triple systems in disk arrays.
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Orthogonal arrays. Theory and applications
- Supermagic Complete Graphs
- Tactical memoranda I-III.
- Trails of triples in partial triple systems
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
This page was built for publication: Asymptotic existence of egalitarian Steiner 2-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613360)
