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: ||Critical subgraphs of a random graph|
|Authors: ||Molloy, M.|
|Keywords: ||random graph|
|Issue Date: ||1999|
|Publisher: ||International Press|
|Citation: ||Molloy,M., Reed, B. (1999). Critical Subgraphs of a random graph. Electronic J. Comb. Vol 6 (1) pp. 35 DUMMY|
|Abstract: ||We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical.|
|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.