test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9488

Title: Critical subgraphs of a random graph
Authors: Molloy, M.
Reed, B.
Keywords: random graph
critical subgraphs
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
URI: http://hdl.handle.net/1807/9488
ISSN: 1077-8926
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
critical subgraphs of a random graph.pdf242.67 kBAdobe PDF
View/Open
critical subgraphs of a random graph.pdf.txt40.82 kBText
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft