Asymptotic enumeration of dense 0--1 matrices with specified line sums

Authors:
E. Rodney Canfield;Catherine Greenhill;Brendan D. McKay
Affiliations:
Department of Computer Science, University of Georgia, Athens, GA 30602, USA;School of Mathematics and Statistics, University of New South Wales, Sydney 2052, Australia;Department of Computer Science, Australian National University, Canberra ACT 0200, Australia
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 5
Cited 1

Asymptotic enumeration by degree sequence of graphs of high degree

European Journal of Combinatorics
Asymptotic enumeration of tournaments with a given score sequence

Journal of Combinatorial Theory Series A
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

Combinatorics, Probability and Computing
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums

Journal of Combinatorial Theory Series A
Two-dimensional weight-constrained codes through enumeration bounds

IEEE Transactions on Information Theory

Subgraphs of dense random graphs with specified degrees

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let s=(s"1,s"2,...,s"m) and t=(t"1,t"2,...,t"n) be vectors of non-negative integers with @?"i"="1^ms"i=@?"j"="1^nt"j. Let B(s,t) be the number of mxn matrices over {0,1} with jth row sum equal to s"j for 1=