zbMATH — the first resource for mathematics

On Lehman’s width-length characterization. (English) Zbl 0747.05066
Polyhedral combinatorics, Proc. Workshop, Morristown/NJ (USA) 1989, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 1, 107-117 (1990).
Summary: [For the entire collection see Zbl 0722.00003.]
We discuss certain results of A. Lehman concerning the structure of “minor-minimal clutters without the width-length property”. These results are analogous to the well-known theorems of Lovász and Padberg asserting that all minimal imperfect graphs are partitionable.

05C65 Hypergraphs
05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05B40 Combinatorial aspects of packing and covering