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

zbMath1076.05006arXivmath/0703600MaRDI QIDQ2571271

E. Rodney Canfield, Brendan D. McKay

Publication date: 1 November 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703600

zbMATH Keywords

bipartite graphssaddle-point method

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Probabilistic existence of regular combinatorial structures, Exact sampling and counting for fixed-margin matrices, A Fourier-analytic approach to counting partial Hadamard matrices, Discrepancy properties for random regular digraphs, Factorisation of the complete bipartite graph into spanning semiregular factors, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Global eigenvalue fluctuations of random biregular bipartite graphs, The circular law for random regular digraphs with random edge weights, On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\), Asymptotic enumeration of integer matrices with large equal row and column sums, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, The maximal length of a chain in the Bruhat order for a class of binary matrices, Nonograms: combinatorial questions and algorithms, Asymptotic enumeration of dense 0-1 matrices with specified line sums, On the singularity of adjacency matrices for random regular digraphs, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, The number of graphs and a random graph with a given degree sequence, Random dense bipartite graphs and directed graphs with specified degrees, Unnamed Item, The circular law for random regular digraphs, Counting loopy graphs with given degrees, Random sampling of contingency tables via probabilistic divide-and-conquer, On the counting problem in inverse Littlewood–Offord theory, Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums