Term rank of 0,1 matrices

zbMATH Open0100.01901MaRDI QIDQ774036FDOQ774036

Authors: Robert Morton Haber 

Publication date: 1960

Published in: Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RSMUP_1960__30__24_0

zbMATH Keywords

combinatorics

Cites Work

• A theorem on flows in networks
• Title not available (Why is that?)
• Combinatorial Properties of Matrices of Zeros and Ones
• The Term Rank of a Matrix

Cited In (10)

• The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
• Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
• Combinatorial aspects of rectangular non-negative matrices
• Matrices uniquely determined by their lonesums
• Matrices of zeros and ones with fixed row and column sum vectors
• Matrices of zeros and ones
• On Haber's minimum term rank formula
• Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
• Supermodularity in unweighted graph optimization. I: Branchings and matchings
• Reconstructing convex matrices by integer programming approaches

This page was built for publication: Term rank of \(0,1\) matrices

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