The class A(R,S) of (0,1)-matrices

DOI10.1016/0012-365X(82)90152-2zbMath0484.15015MaRDI QIDQ1163614

S. Singh

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower bound to the cardinalityzero-one-matrices with prescribed row and column sum vectors

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36) Matrices, determinants in number theory (11C20)

Related Items (9)

On the number of tournaments with prescribed score vector ⋮ On assignment functions ⋮ The Number of Subtrees of Trees with Given Degree Sequence ⋮ Disproof of a conjecture on assignment functions ⋮ On the enumeration of rectangular (0, 1)-matrices ⋮ An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors ⋮ On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\) ⋮ On normal matrices of zeros and ones with fixed row sum ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• A theorem on flows in networks
• Group characters and nonnegative integral matrices
• Combinatorial Properties of Matrices of Zeros and Ones
• Matrices of zeros and ones

This page was built for publication: The class A(R,S) of (0,1)-matrices