E-resources
Peer reviewed
-
Yan, Yun-Zhi; Wang, Han-Xing; Wang, Jun; Yin, Xiang-Feng
Statistics & probability letters, 08/2008, Volume: 78, Issue: 11Journal Article
For graphs G n on n vertices and H ( n ) on h n vertices, where h n divides n , an H ( n ) -factor of G n is a spanning subgraph of G n consisting of n / h n 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 Ruciński and by Krivelevich.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.