Upper bounds on the non-3-colourability threshold of random graphs.
Fountoulakis, Nikolaos; McDiarmid, Colin
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2002)
- Volume: 5, Issue: 1, page 205-226
- ISSN: 1365-8050
Access Full Article
topHow to cite
topFountoulakis, Nikolaos, and McDiarmid, Colin. "Upper bounds on the non-3-colourability threshold of random graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 5.1 (2002): 205-226. <http://eudml.org/doc/122637>.
@article{Fountoulakis2002,
author = {Fountoulakis, Nikolaos, McDiarmid, Colin},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {sparse random graphs; 3-colourability; thresholds},
language = {eng},
number = {1},
pages = {205-226},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Upper bounds on the non-3-colourability threshold of random graphs.},
url = {http://eudml.org/doc/122637},
volume = {5},
year = {2002},
}
TY - JOUR
AU - Fountoulakis, Nikolaos
AU - McDiarmid, Colin
TI - Upper bounds on the non-3-colourability threshold of random graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2002
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 5
IS - 1
SP - 205
EP - 226
LA - eng
KW - sparse random graphs; 3-colourability; thresholds
UR - http://eudml.org/doc/122637
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.