scientific article; zbMATH DE number 16723

MaRDI QIDQ3973409zbMATH OpenFDO

Authors Alfred Lehman

Publication date 26 June 1992

zbMATH Keywords

degenerate projective planeswidth-length inequality

Mathematics Subject Classification ID

Hypergraphs (05C65) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 16724
• scientific article; zbMATH DE number 3940110
• scientific article; zbMATH DE number 3899984
• Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks
• Projective planes and congestion-free networks

Cited in

(37)

• On the set covering polyhedron of circulant matrices
• Lehman matrices
• A catalog of minimally nonideal matrices
• A note on clutter partitions
• One-overlapped factorizations of non-abelian groups
• A characterization of weakly bipartite graphs
• A short proof of Guenin's characterization of weakly bipartite graphs
• Applying Lehman's theorems to packing problems
• Cuboids, a class of clutters
• A new infinite class of ideal minimally non-packing clutters
• Testing idealness in the filter oracle model
• On ideal semicomplete digraphs
• Structure of cubic Lehman matrices
• Some insight into characterizations of minimally nonideal matrices
• Clutter nonidealness
• On a certain class of nonideal clutters
• Intersecting restrictions in clutters
• Single commodity-flow algorithms for lifts of graphic and cographic matroids
• An extension of Lehman's theorem and ideal set functions
• Delta minors, delta free clutters, and entanglement
• Arithmetic relations in the set covering polyhedron of circulant clutters
• The nonidealness index of circulant matrices
• Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
• Resistant sets in the unit hypercube
• Opposite elements in clutters
• Ideal clutters that do not pack
• scientific article; zbMATH DE number 2230198 (Why is no real title available?)
• Perfect, ideal and balanced matrices
• On Packing Dijoins in Digraphs and Weighted Digraphs
• A new infinite family of minimally nonideal matrices
• From coordinate subspaces over finite fields to ideal multipartite uniform clutters
• Ideal clutters
• Dominating set games.
• Vertex adjacencies in the set covering polyhedron
• Consequences of the packing problem
• The nonidealness index of rank-ideal matrices
• On packing and covering polyhedra of consecutive ones circulant clutters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973409)