An Algorithm for Distinct Representatives

DOI10.2307/2309562MaRDI QIDQ3239292zbMATH OpenOpenAlexFDO

Authors Marshall jun. Hall

Publication date 1956

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

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

zbMATH Keywords

CombinatoricsGeneral Theory

Cited in

(11)

• Hard Enumeration Problems in Geometry and Combinatorics
• Stirling numbers and records
• The complexity of computing the permanent
• Systems of representatives
• On the determination and construction of optimal row-column designs having unequal row and column sizes
• A note on the decomposition of systems of sparse non-linear equations
• Optimum distance flag codes from spreads via perfect matchings in graphs
• A POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERING
• Sensitivity analysis of linear systems—a structural approach
• Matching theory -- a sampler: From Dénes König to the present
• On the Inversion of Sparse Matrices

This page was built for publication: An Algorithm for Distinct Representatives

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