T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Please use this identifier to cite or link to this item:
|Title: ||Almost all graphs with 2:522n edges are not 3-colorable|
|Authors: ||Achlioptas, D.|
|Keywords: ||random graph|
|Issue Date: ||1999|
|Publisher: ||International Press|
|Citation: ||Achlioptas, D., Molloy, M. (1999). Almost all graphs with 2:522n edges are not 3-colorable. Vol 6 (1). pp. 29DUMMY|
|Abstract: ||We prove that for c 2≥522 a random graph with n vertices and m = cn edges is not 3-colorable with probability 1 - o(1). Similar bounds for non-k-colorability are given for k > 3.|
|Description: ||published source has been acknowledged.
journal website: http://www.combinatorics.org/Volume_6/v6i1toc.html|
|Appears in Collections:||Mathematics|
Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.