Nimrod Megiddo
Journal of Symbolic Computation
Paper
Total unimodularity and combinatorial theorems
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.
Related
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences