Journal article
The early evolution of the H-free process
- Abstract:
-
The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at the end of the process. When H is strictly 2-balanced, we show that for some c>0, with high probability as $n \to \infty$, the minimum degree in G is at least $cn^{1-(v_H-2)/(e_H-1)}(\log n)^{1/(...
Expand abstract
Actions
Access Document
- Publisher copy:
- 10.1007/s00222-010-0247-x
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- Inventiones Mathematicae
- Volume:
- 181
- Issue:
- 2
- Pages:
- 291-336
- Publication date:
- 2009-08-04
- DOI:
- EISSN:
-
1432-1297
- ISSN:
-
0020-9910
- Source identifiers:
-
430652
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:430652
- UUID:
-
uuid:5bff9302-49c0-49ac-aad5-077d4eb3f0bc
- Local pid:
- pubs:430652
- Deposit date:
- 2013-11-16
Terms of use
- Copyright date:
- 2009
- Notes:
- 36 pages
If you are the owner of this record, you can report an update to it here: Report update to this record