Total unimodularity and combinatorial theorems

Alan J. Hoffman

doi:10.1016/0024-3795(76)90047-1

Linear Algebra and Its Applications

Paper

01 Jan 1976

Total unimodularity and combinatorial theorems

View publication

Abstract

It is shown how a wide variety of transversal theorems can be given a common proof. The proof depends on a certain matrix being totally unimodular, and it is shown that total unimodularity is needed for the theorem to hold. © 1976.

Conference paper

On Application of the Simplex Type Algorithm for SCLP to Large-scale Fluid Processing Networks

Paper

Calibrating Noise to Variance in Adaptive Data Analysis

Paper

Complex-time shredded propagator method for large-scale GW calculations

Poster

Uncovering signals of cell state transition using topological data analysis in single cell data

View all publications

Abstract

Related

On Application of the Simplex Type Algorithm for SCLP to Large-scale Fluid Processing Networks

Calibrating Noise to Variance in Adaptive Data Analysis

Complex-time shredded propagator method for large-scale GW calculations

Uncovering signals of cell state transition using topological data analysis in single cell data