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

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Juliann Opitz, Robert D. Allen, et al.

Microlithography 1998

Paper

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Paper

A minimal descriptor of an ancestral recombinations graph

Laxmi Parida, Pier F. Palamara, et al.

BMC Bioinformatics

Paper

Conditional generative models for learning stochastic processes

Salvatore Certo, Anh Pham, et al.

Quantum Machine Intelligence

View all publications

Abstract

Related

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Multiparameter parallel search branch switching

A minimal descriptor of an ancestral recombinations graph

Conditional generative models for learning stochastic processes