Vector transversals

DOI10.1016/0095-8956(82)90035-1zbMath0467.05024OpenAlexW4212843425MaRDI QIDQ1155624

Douglas R. Woodall

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90035-1

zbMATH Keywords

linear programmingtransversalpolymatroidsmax-flow min-cut theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (1)

On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs

Cites Work

• Transversal theory. An account of some aspects of combinatorial mathematics
• Applications of the notion of independence to problems of combinatorial analysis
• Systems of representatives
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vector transversals