Journal article

Upper bounds on the non-3-colourability threshold of random graphs.

Publication status:: Published

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Fountoulakis, N., & McDiarmid, C. (2002). Upper bounds on the non-3-colourability threshold of random graphs. Discrete Mathematics and Theoretical Computer Science, 5(1), 205–226.

MLA Style

Fountoulakis, N, and C McDiarmid. “Upper Bounds on the Non-3-Colourability Threshold of Random Graphs.” Discrete Mathematics and Theoretical Computer Science, vol. 5, no. 1, 2002, pp. 205–26.

Chicago Style

Fountoulakis, N, and C McDiarmid. 2002. “Upper Bounds on the Non-3-Colourability Threshold of Random Graphs.” Discrete Mathematics and Theoretical Computer Science 5 (1): 205–26.
Print

Authors

+ Fountoulakis, N More by this author

Role:: Author

+ McDiarmid, C More by this author

Role:: Author

Journal:: Discrete Mathematics and Theoretical Computer Science More from this journal
Volume:: 5
Issue:: 1
Pages:: 205-226
Publication date:: 2002-01-01
ISSN:: 1365-8050

Keywords:: 3-colourability

thresholds

sparse random graphs
Pubs id:: pubs:102302
UUID:: uuid:eb05d70e-e89a-4b7e-a029-e4e7a16e8e43
Local pid:: pubs:102302
Source identifiers:: 102302
Deposit date:: 2012-12-19
ARK identifier:: ark:/29072/ora_eb05d70ee89a4b7ea029e4e7a16e8e43

Terms of use

Copyright date:: 2002

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP