The Term Rank of a Matrix

DOI10.4153/CJM-1958-006-2zbMATH Open0079.01103OpenAlexW2314824872MaRDI QIDQ3246339FDOQ3246339

Authors: Herbert John Ryser 

Publication date: 1958

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1958-006-2

zbMATH Keywords

CombinatoricsGeneral Theory

Cited In (12)

• Term rank of \(0,1\) matrices
• The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
• Combinatorial aspects of rectangular non-negative matrices
• A minimal completion of \((0,1)\)-matrices without total support
• Matrices of zeros and ones with fixed row and column sum vectors
• Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
• Matrices of zeros and ones
• General forbidden configuration theorems
• Supermodularity in unweighted graph optimization. I: Branchings and matchings
• Matrices of 0's and 1's with total support
• Uniformly sparse graphs and matrices
• On Ryser's maximum term rank formula

This page was built for publication: The Term Rank of a Matrix

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