A Simple Proof of the Gale-Ryser Theorem

DOI10.2307/2975191MaRDI QIDQ4888627zbMATH OpenOpenAlexFDO

Authors Manfred Krause

Publication date 20 October 1996

Published in The American Mathematical Monthly (Search for Journal in Brave)

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

zbMATH Keywords

Ferrers matrixGale-Ryser theorempartition

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• scientific article; zbMATH DE number 7057496
• Constructing integral matrices with given line sums
• Graphs with given valences
• Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices

Cited in

(14)

• Cooperation in partly observable networked markets
• Graphs with given valences
• scientific article; zbMATH DE number 3859133 (Why is no real title available?)
• scientific article; zbMATH DE number 4059421 (Why is no real title available?)
• Chains and antichains in the Bruhat order for classes of (0,1)-matrices
• Two-colorings with many monochromatic cliques in both colors
• Lorentz and Gale–Ryser theorems on general measure spaces
• scientific article; zbMATH DE number 4189554 (Why is no real title available?)
• Weighted projections of alternating sign matrices: Latin-like squares and the ASM polytope
• The maximal length of a chain in the Bruhat order for a class of binary matrices
• Gap one bounds for the equitable chromatic number of block graphs
• Two variable logic with ultimately periodic counting
• On the role of the equal partition in degree realization by a bipartite graph
• Majorization classes of integral matrices

This page was built for publication: A Simple Proof of the Gale-Ryser Theorem

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