Combinatorial Properties of Matrices of Zeros and Ones
暂无分享,去创建一个
This paper is concerned with a matrix A of m rows and n columns, all of whose entries are 0's and l's. Let the sum of row i of A be denoted by r i (i = 1, … , m) and let the sum of column i of A be denoted by s i (i = 1, … , n).
[1] O. Ore. Graphs and matching theorems , 1955 .
[2] H. Ryser. A combinatorial theorem with an application to latin rectangles , 1951 .
[3] M. Hall. An existence theorem for latin squares , 1945 .
[4] P. Hall. On Representatives of Subsets , 1935 .
[5] R. Muirhead. Some Methods applicable to Identities and Inequalities of Symmetric Algebraic Functions of n Letters , 1902 .