Solution of two fractional packing problems of Lovász. (Reprint)

DOI10.1016/j.disc.2006.03.018zbMath1097.05030OpenAlexW1994045301MaRDI QIDQ2497997

P. D. Seymour

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.018

zbMATH Keywords

hypergraphcoveringmatchingfractional covering

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)

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. (Reprint)