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 - http://www.scopus.com/inward/record.url?scp=0040792686&partnerID=8YFLogxK
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 -