Journal article
Random Graphs from a Minor-Closed Class.
- Abstract:
-
A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a class A of labelled graphs has smooth growth; and, for the random graph R n sampled uniformly from the n-vertex graphs in A, the fragment not in the giant component asymptotically has a simple 'Boltzmann Poisson distribution'. In particular, as n → ∞ the probability that R n is connected tends to 1/A(ρ), where A(x) is the exponential generating ...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1017/S0963548309009717
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:
- Combinatorics, Probability and Computing
- Volume:
- 18
- Issue:
- 4
- Pages:
- 583-599
- Publication date:
- 2009-01-01
- DOI:
- EISSN:
-
1469-2163
- ISSN:
-
0963-5483
- Source identifiers:
-
102283
Item Description
- Language:
- English
- Pubs id:
-
pubs:102283
- UUID:
-
uuid:85743fad-0945-4861-9716-03bf232bbd56
- Local pid:
- pubs:102283
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2009
If you are the owner of this record, you can report an update to it here: Report update to this record