Asymptotic enumeration of 0–1 matrices w
✍
Brendan D. McKay; Xiaoji Wang
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 158 KB
Let s, t, m, n be positive integers such that sm = tn. Define N (s, t; m, n) to be the number of m × n matrices with entries from {0, 1}, such that each row sum is s and each column sum is t. Equivalently, N(s, t; m, n) is the number of labelled semiregular bipartite graphs, where one colour class c