On the fractional matching polytope of a hypergraph

Z. Füredi, J. Kahn, P. D. Seymour

Research output: Contribution to journalArticlepeer-review

32 Scopus citations


For a hypergraph ℋ and b:ℋ→ℝ+ define[Figure not available: see fulltext.] Conjecture. There is a matching ℳ of ℋ such that[Figure not available: see fulltext.] For uniform ℋ and b constant this is the main theorem of [4]. Here we prove the conjecture if ℋ is uniform or intersecting, or b is constant.

Original languageEnglish (US)
Pages (from-to)167-180
Number of pages14
Issue number2
StatePublished - Jun 1993
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics


  • AMS Subject Classification Code (1991): 05D15


Dive into the research topics of 'On the fractional matching polytope of a hypergraph'. Together they form a unique fingerprint.

Cite this