Large Regular Factors in Random Graphs

E. Shamir; E. Upfal

doi:10.1016/S0304-0208(08)72835-4

Large Regular Factors in Random Graphs

E. Shamir
, E. Upfal

Einstein Institute of Mathematics

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

9 Scopus citations

Abstract

Does a graph G contain a large regular factor H on “most” edges? For random graph spaces G_n,p, G _n,N N = N. w(n)log n, w(n)→ ∞, we prove the answer is positive with probability 1 -o(1) even if we take out just a vanishing fraction of the edges. The result holds also for almost regular factors, and it derives a good lower bound on the number of regular graphs in G_n,N.

Original language	English
Pages (from-to)	271-282
Number of pages	12
Journal	North-Holland Mathematics Studies
Volume	87
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)72835-4
State	Published - 1 Jan 1984

Access to Document

10.1016/S0304-0208(08)72835-4

Cite this

@article{533b5fda3a7749a9bc7f229ae30ef972,

title = "Large Regular Factors in Random Graphs",

abstract = "Does a graph G contain a large regular factor H on “most” edges? For random graph spaces Gn,p, G n,N N = N. w(n)log n, w(n)→ ∞, we prove the answer is positive with probability 1 -o(1) even if we take out just a vanishing fraction of the edges. The result holds also for almost regular factors, and it derives a good lower bound on the number of regular graphs in Gn,N.",

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

year = "1984",

month = jan,

day = "1",

doi = "10.1016/S0304-0208(08)72835-4",

language = "אנגלית",

volume = "87",

pages = "271--282",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - Large Regular Factors in Random Graphs

AU - Shamir, E.

AU - Upfal, E.

PY - 1984/1/1

Y1 - 1984/1/1

N2 - Does a graph G contain a large regular factor H on “most” edges? For random graph spaces Gn,p, G n,N N = N. w(n)log n, w(n)→ ∞, we prove the answer is positive with probability 1 -o(1) even if we take out just a vanishing fraction of the edges. The result holds also for almost regular factors, and it derives a good lower bound on the number of regular graphs in Gn,N.

AB - Does a graph G contain a large regular factor H on “most” edges? For random graph spaces Gn,p, G n,N N = N. w(n)log n, w(n)→ ∞, we prove the answer is positive with probability 1 -o(1) even if we take out just a vanishing fraction of the edges. The result holds also for almost regular factors, and it derives a good lower bound on the number of regular graphs in Gn,N.

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

U2 - 10.1016/S0304-0208(08)72835-4

DO - 10.1016/S0304-0208(08)72835-4

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

AN - SCOPUS:0040792686

SN - 0304-0208

VL - 87

SP - 271

EP - 282

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

IS - C

ER -

Large Regular Factors in Random Graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this