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

Byzantine-Robust Decentralized Federated Learning

Minghong Fang, Zifan Zhang, et al.

CCS 2024

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

View all publications

Abstract

Related

Byzantine-Robust Decentralized Federated Learning

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

A remark on an algorithm for best Lp approximation

Output distribution of the burrows-wheeler transform

A remark on an algorithm for best L^p approximation