Counting Binary Matrices with Given Row and Column Sums

DOI10.2307/2007840MaRDI QIDQ3029028zbMATH OpenOpenAlexFDO

Authors Ben Johnsen, Eldar Straume

Publication date 1987

Full work available at URL https://doi.org/10.2307/2007840

zbMATH Keywords

binary matricesenumerationlabelled graphs

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• scientific article; zbMATH DE number 969973
• scientific article; zbMATH DE number 5532147
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Some formulas of (0,1)-matrices

Cited in

(10)

• Arranging apples in an array
• Smallest and largest binary sums of a graph
• scientific article; zbMATH DE number 4135983 (Why is no real title available?)
• scientific article; zbMATH DE number 5532147 (Why is no real title available?)
• Exact sampling and counting for fixed-margin matrices
• Calculating the cardinality of some classes of binary matrices using bitwise operations -- a polynomial algorithm
• Counting on matrices
• Battleship, tomography and quantum annealing
• Counting unlabeled bipartite graphs using Polya's theorem
• Diagonal operators, q-Whittaker functions and rook theory

This page was built for publication: Counting Binary Matrices with Given Row and Column Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3029028)