On the fractional matching polytope of a hypergraph
From MaRDI portal
Publication:684403
DOI10.1007/BF01303202zbMath0779.05030WikidataQ104377133 ScholiaQ104377133MaRDI QIDQ684403
P. D. Seymour, Jeffry Kahn, Zoltan Fueredi
Publication date: 15 September 1993
Published in: Combinatorica (Search for Journal in Brave)
hypergraph; matching; \(k\)-uniform hypergraph; intersecting hypergraph; fractional matching; fractional matching polytope
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05D15: Transversal (matching) theory
Related Items
Intersecting designs from linear programming and graphs of diameter two, Weighted fractional and integral \(k\)-matching in hypergraphs, Matchings and covers in hypergraphs
Cites Work