论文信息 - A General Upper Bound for 1-Widths

A General Upper Bound for 1-Widths

Abstract Let A be an m × n (0, 1)-matrix having row sums ⩾ r and column sums ⩽ c . An upper bound for the 1-width of A is obtained in terms of m, n, r, c .

J. R. Henderson | R. A. Dean

[1] J. R. Henderson,et al. The 1-Width of (0, 1)-Matrices Having Constant Row Sum 3 , 1974, J. Comb. Theory, Ser. A.

[2] R. Bellman,et al. On a Problem in Additive Number Theory , 1948 .

[3] S. K Stein,et al. Two Combinatorial Covering Theorems , 1974, J. Comb. Theory, Ser. A.

[4] MAXIMAL DEPTH OF A CLASS OF $ (0,1)$-MATRICES , 1968 .