Solution of two fractional packing problems of Lovász

DOI10.1016/0012-365X(79)90122-5MaRDI QIDQ1260046zbMATH OpenOpenAlexFDO

Authors Paul Seymour, Alexander Schrijver

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(79)90122-5

zbMATH Keywords

fractional packinghypergraphinteger linear programmingmatching numbertransversal number

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear programming (90C05) Integer programming (90C10)

Cites work

• 2-Matchings and 2-covers of hypergraphs
• scientific article; zbMATH DE number 3477226 (Why is no real title available?)
• scientific article; zbMATH DE number 3559289 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3415888 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property

Cited in

(1)

• Matchings and covers in hypergraphs

This page was built for publication: Solution of two fractional packing problems of Lovász

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