Conference item
Random cubic planar graphs.
- Abstract:
-
We show that the number of labeled cubic planar graphs on n vertices with n even is asymptotically αn-7/2 ρ-nn!, where ρ-1 = 3.13259 and α are analytic constants. We show also that the chromatic number of a random cubic planar graph that is chosen uniformly at random among all the labeled cubic planar graphs on n vertices is three with probability tending to e-ρ4/4! = 0.999568 and four with probability tending to 1 - e-ρ4/4! as n → ∞ with n even. The proof given combines generating function t...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1002/rsa.20149
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
- Volume:
- 30
- Issue:
- 1-2
- Pages:
- 78-94
- Host title:
- Random Struct. Algorithms
- Publication date:
- 2007-01-01
- DOI:
- EISSN:
-
1098-2418
- ISSN:
-
1042-9832
- Source identifiers:
-
102289
Item Description
- Keywords:
- Pubs id:
-
pubs:102289
- UUID:
-
uuid:dc57a133-b38f-467a-8904-45ac2997f371
- Local pid:
- pubs:102289
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2007
If you are the owner of this record, you can report an update to it here: Report update to this record