Solution of two fractional packing problems of Lovász

DOI10.1016/0012-365X(79)90122-5zbMath0413.05044OpenAlexW4213294993MaRDI QIDQ1260046

P. D. Seymour

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

hypergraphmatching numberinteger linear programmingtransversal numberfractional packing

Mathematics Subject Classification ID

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

Related Items (1)

Matchings and covers in hypergraphs

Cites Work

• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• Normal hypergraphs and the perfect graph conjecture
• 2-Matchings and 2-covers of hypergraphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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