On the fractional matching polytope of a hypergraph

DOI10.1007/BF01303202MaRDI QIDQ684403zbMATH OpenWikidataFDO

Authors Zoltán Füredi, J. Kahn, Paul Seymour

Publication date 15 September 1993

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

matchinghypergraphfractional matchingintersecting hypergraph\(k\)-uniform hypergraphfractional matching polytope

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Recommendations

• On a criterion for matchability in hypergraphs
• Fractional matchings in hypergraphs
• Fractional v. integral covers in hypergraphs of bounded edge size
• Matchings in n-partite n-graphs

Cites work

• A Theorem on Coloring the Lines of a Network
• Graph Theory and Integer Programming
• Matchings and covers in hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Packing Problems and Hypergraph Theory: A Survey

Cited in

(31)

• Linear programming in the semi-streaming model with application to the maximum matching problem
• On a criterion for matchability in hypergraphs
• Fractional matchings in hypergraphs
• Membership criteria and containments of powers of monomial ideals
• Matchings in n-partite n-graphs
• Improved bounds in stochastic matching and optimization
• Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
• Solution of two fractional packing problems of Lovász. (Reprint)
• On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
• When LP is the cure for your matching woes: improved bounds for stochastic matchings
• An approximation result for matchings in partitioned hypergraphs
• The skiving stock problem and its relation to hypergraph matchings
• An extension of matching theory
• Fractional perfect \(b\)-matching polytopes. I: General theory
• Matchings and covers in hypergraphs
• Intersecting designs from linear programming and graphs of diameter two
• Fractional matchings and covers in infinite hypergraphs
• Graph and hypergraph colouring via nibble methods: a survey
• Weighted fractional and integral k-matching in hypergraphs
• Coloring by two-way independent sets
• Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
• Matching criticality in intersecting hypergraphs
• A remark on the problem of nonnegative \(k\)-subset sums
• Iterative packing for demand and hypergraph matching
• Generalized hypergraph matching via iterated packing and local ratio
• Fractional strong matching preclusion for two variants of hypercubes
• Inapproximability of \(b\)-matching in \(k\)-uniform hypergraphs
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach
• On linear and semidefinite programming relaxations for hypergraph matching
• Maximum size of a graph with given fractional matching number
• t-expansive and t-wise intersecting hypergraphs

This page was built for publication: On the fractional matching polytope of a hypergraph

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