Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums

@article{Canfield2005AsymptoticEO,
  title={Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums},
  author={E. Rodney Canfield and Brendan D. McKay},
  journal={Electr. J. Comb.},
  year={2005},
  volume={12}
}
Let s, t,m, n be positive integers such that sm = tn. Let B(m, s;n, t) be the number of m×n matrices over {0, 1} with each row summing to s and each column summing to t. Equivalently, B(m, s;n, t) is the number of semiregular bipartite graphs with m vertices of degree s and n vertices of degree t. Define the density λ = s/n = t/m. The asymptotic value of B(m, s;n, t) has been much studied but the results are incomplete. McKay and Wang (2003) solved the sparse case λ(1−λ) = o((mn)−1/2) using… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums

B. D. McKay, X. Wang
Linear Alg. Appl., 373 • 2003
View 5 Excerpts
Highly Influenced

Applications of a technique for labelled enumeration

B. D. McKay
Congressus Numerantium, 40 • 1983
View 6 Excerpts
Highly Influenced

Asymptotic enumeration of sparse irregular bipartite graphs

C. S. Greenhill, B. D. McKay, X. Wang
J. Combinatorial Theory, Ser. A, to appear. the electronic journal of combinatorics 12 • 2005
View 3 Excerpts

Some enumeration problems in graph theory

R. C. Read
Doctoral Thesis, London University, (1958). the electronic journal of combinatorics 12 • 2005
View 1 Excerpt

On the capacity of two-dimensional weight-constrained memories

Algebraic Coding Theory and Information Theory • 2003
View 3 Excerpts

Wormald , Asymptotic enumeration by degree sequence of graphs of high degree

C. N.
European J . Combinatorics • 2003

Similar Papers

Loading similar papers…