Pages that link to "Item:Q2500997"
From MaRDI portal
The following pages link to On the number of possible row and column sums of \(0,1\)-matrices (Q2500997):
Displaying 13 items.
- An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors (Q393474) (← links)
- The class of matrices of zeros, ones, and twos with prescribed row and column sums (Q803137) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- On asymmetric \((0,1)\)-matrices with given row and column sum vectors (Q1343808) (← links)
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) (Q1943693) (← links)
- Nonograms: combinatorial questions and algorithms (Q2449056) (← links)
- A combinatorial problem associated with nonograms (Q2575597) (← links)
- Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices (Q2711488) (← links)
- On the sum of two<i>N</i><sub>0</sub>-matrices (Q3469222) (← links)
- (Q4449412) (← links)
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices (Q4554532) (← links)
- Possible numbers of ones in 0–1 matrices with a given rank (Q5317722) (← links)
- (Q5688090) (← links)