Critical Subgraphs of a Random Graph

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. 1991 Mathematics Subject Classification: Primary 05C80; Secondary 05C15.

• Type: Journal
• Year: 1999
• Where: COMBINATORICS
• Authors: Michael Molloy, Bruce A. Reed
• Keywords: COMBINATORICS 1999, Mathematics Subject Classification, Necessary Condition, Random Graph