On the fractional matching polytope of a hypergraph
From MaRDI portal
Publication:684403
DOI10.1007/BF01303202zbMath0779.05030WikidataQ104377133 ScholiaQ104377133MaRDI QIDQ684403
Jeffry Kahn, P. D. Seymour, Zoltan Fueredi
Publication date: 15 September 1993
Published in: Combinatorica (Search for Journal in Brave)
hypergraphmatching\(k\)-uniform hypergraphintersecting hypergraphfractional matchingfractional matching polytope
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items (18)
Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Weighted fractional and integral \(k\)-matching in hypergraphs ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ Iterative Packing for Demand and Hypergraph Matching ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ Improved bounds in stochastic matching and optimization ⋮ Membership criteria and containments of powers of monomial ideals ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ An Approximation Result for Matchings in Partitioned Hypergraphs ⋮ Inapproximability of b-Matching in k-Uniform Hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Coloring by two-way independent sets ⋮ Intersecting designs from linear programming and graphs of diameter two
Cites Work
This page was built for publication: On the fractional matching polytope of a hypergraph
