On the fractional matching polytope of a hypergraph

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

doi:10.1007/BF01303202

On the fractional matching polytope of a hypergraph

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

Research output: Contribution to journal › Article › peer-review

32 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	167-180
Number of pages	14
Journal	Combinatorica
Volume	13
Issue number	2
DOIs	https://doi.org/10.1007/BF01303202
State	Published - Jun 1993
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Computational Mathematics

Keywords

AMS Subject Classification Code (1991): 05D15

Access to Document

10.1007/BF01303202

Cite this

@article{52b7b1425a0c499d956d9281539eab0a,

title = "On the fractional matching polytope of a hypergraph",

abstract = "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.",

keywords = "AMS Subject Classification Code (1991): 05D15",

author = "Z. F{\"u}redi and J. Kahn and Seymour, {P. D.}",

year = "1993",

month = jun,

doi = "10.1007/BF01303202",

language = "English (US)",

volume = "13",

pages = "167--180",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "2",

}

TY - JOUR

T1 - On the fractional matching polytope of a hypergraph

AU - Füredi, Z.

AU - Kahn, J.

AU - Seymour, P. D.

PY - 1993/6

Y1 - 1993/6

N2 - 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.

AB - 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.

KW - AMS Subject Classification Code (1991): 05D15

UR - http://www.scopus.com/inward/record.url?scp=0010784118&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010784118&partnerID=8YFLogxK

U2 - 10.1007/BF01303202

DO - 10.1007/BF01303202

M3 - Article

AN - SCOPUS:0010784118

SN - 0209-9683

VL - 13

SP - 167

EP - 180

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

On the fractional matching polytope of a hypergraph

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this