Minimum range sequences of all k-subsets of a set

DOI10.1016/0012-365X(77)90105-4zbMath0384.05018OpenAlexW2062440212MaRDI QIDQ1248520

Jeffrey C. Lagarias, Frank K. Hwang

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90105-4

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Stochastic network models in operations research (90B15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (5)

New results on edge-bandwidth ⋮ Edge-bandwidth of grids and tori ⋮ Lower bounds for the bandwidth problem ⋮ On edge numberings of the \(n\)-cube graph ⋮ On the edge-bandwidth of graph products

Cites Work

• Pair designs
• Link designs and probability analyses for a class of connecting networks

This page was built for publication: Minimum range sequences of all k-subsets of a set