A threshold for perfect matchings in random d-pure hypergraphs

Jeanette Schmidt; Eli Shamir

doi:10.1016/0012-365X(83)90044-4

A threshold for perfect matchings in random d-pure hypergraphs

Jeanette Schmidt^*
, Eli Shamir

^*Corresponding author for this work

Einstein Institute of Mathematics

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

22 Scopus citations

Abstract

It is shown that d-pure hypergraphs with n vertices and more than n^{3 2} random edges contain a perfect matching with probability 1 as n → ∞.

Original language	English
Pages (from-to)	287-295
Number of pages	9
Journal	Discrete Mathematics
Volume	45
Issue number	2-3
DOIs	https://doi.org/10.1016/0012-365X(83)90044-4
State	Published - 1983

Access to Document

10.1016/0012-365X(83)90044-4

Cite this

@article{7096ef778e764636b7c5aa4ded0934b5,

title = "A threshold for perfect matchings in random d-pure hypergraphs",

abstract = "It is shown that d-pure hypergraphs with n vertices and more than n 3 2 random edges contain a perfect matching with probability 1 as n → ∞.",

author = "Jeanette Schmidt and Eli Shamir",

year = "1983",

doi = "10.1016/0012-365X(83)90044-4",

language = "אנגלית",

volume = "45",

pages = "287--295",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "2-3",

}

TY - JOUR

T1 - A threshold for perfect matchings in random d-pure hypergraphs

AU - Schmidt, Jeanette

AU - Shamir, Eli

PY - 1983

Y1 - 1983

N2 - It is shown that d-pure hypergraphs with n vertices and more than n 3 2 random edges contain a perfect matching with probability 1 as n → ∞.

AB - It is shown that d-pure hypergraphs with n vertices and more than n 3 2 random edges contain a perfect matching with probability 1 as n → ∞.

UR - https://www.scopus.com/pages/publications/0040064156

U2 - 10.1016/0012-365X(83)90044-4

DO - 10.1016/0012-365X(83)90044-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0040064156

SN - 0012-365X

VL - 45

SP - 287

EP - 295

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2-3

ER -

A threshold for perfect matchings in random d-pure hypergraphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this