On the number of possible row and column sums of \(0,1\)-matrices

zbMath1098.05007MaRDI QIDQ2500997

Yanyan Li

Publication date: 30 August 2006

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

Full work available at URL: https://eudml.org/doc/126509

zbMATH Keywords

divisibility result

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (4)

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) ⋮ Nonograms: combinatorial questions and algorithms ⋮ A combinatorial problem associated with nonograms

This page was built for publication: On the number of possible row and column sums of \(0,1\)-matrices