Certain dense partial S(t,t+1,v) designs admit labelings achieving the elementary lower bound on block-sum differences, and every admissible Steiner triple system S(2,3,v) admits a labeling within an additive constant of that bound.
Derandomizing Chebyshev’s inequality to find indep endent sets in un- crowded hypergraphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Access Balancing in Storage Systems by Labeling Partial Steiner Systems
Certain dense partial S(t,t+1,v) designs admit labelings achieving the elementary lower bound on block-sum differences, and every admissible Steiner triple system S(2,3,v) admits a labeling within an additive constant of that bound.