H(n)-factors in random graphs

Yun-Zhi Yan, Han-Xing Wang, Jun Wang and Xiang-Feng Yin

Statistics & Probability Letters, 2008, vol. 78, issue 11, 1255-1258

Abstract: For graphs Gn on n vertices and H(n) on hn vertices, where hn divides n, an H(n)-factor of Gn is a spanning subgraph of Gn consisting of n/hn vertex disjoint copies of H(n). Our main result has supplied a lower bound (or upper bound) of p in the problem of determining the minimal (or maximal) probability p=p(n), for which almost surely random graph G(n;p) contains an (or contains no) H(n)-factor, where H(n) satisfies certain conditions. The bound of p for the same problem when H(n) is a fixed graph has been studied by Alon and Yuster and by Rucinski and by Krivelevich.

Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(07)00402-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:78:y:2008:i:11:p:1255-1258

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().