One-factor in random graphs based on vertex choice

E. Shamir; E. Upfal

doi:10.1016/0012-365X(82)90023-1

One-factor in random graphs based on vertex choice

E. Shamir^*, E. Upfal

^*Corresponding author for this work

Einstein Institute of Mathematics

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

16 Scopus citations

Abstract

The following result is proved: Consider a random graph on n vertices where each vertex chooses randomly a set of c neighbors. If c≥6, then the graph has a 1-factor, with probability→1 as n→∞.

Original language	English
Pages (from-to)	281-286
Number of pages	6
Journal	Discrete Mathematics
Volume	41
Issue number	3
DOIs	https://doi.org/10.1016/0012-365X(82)90023-1
State	Published - 1982

Access to Document

10.1016/0012-365X(82)90023-1

Cite this

@article{9968c76efd36495d85641093d2c62c83,

title = "One-factor in random graphs based on vertex choice",

abstract = "The following result is proved: Consider a random graph on n vertices where each vertex chooses randomly a set of c neighbors. If c≥6, then the graph has a 1-factor, with probability→1 as n→∞.",

author = "E. Shamir and E. Upfal",

year = "1982",

doi = "10.1016/0012-365X(82)90023-1",

language = "אנגלית",

volume = "41",

pages = "281--286",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - One-factor in random graphs based on vertex choice

AU - Shamir, E.

AU - Upfal, E.

PY - 1982

Y1 - 1982

N2 - The following result is proved: Consider a random graph on n vertices where each vertex chooses randomly a set of c neighbors. If c≥6, then the graph has a 1-factor, with probability→1 as n→∞.

AB - The following result is proved: Consider a random graph on n vertices where each vertex chooses randomly a set of c neighbors. If c≥6, then the graph has a 1-factor, with probability→1 as n→∞.

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

U2 - 10.1016/0012-365X(82)90023-1

DO - 10.1016/0012-365X(82)90023-1

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

AN - SCOPUS:0344781283

SN - 0012-365X

VL - 41

SP - 281

EP - 286

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

One-factor in random graphs based on vertex choice

Abstract

Access to Document

Other files and links

Fingerprint

Cite this