Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

COMBINATORICS
1999

favoriteEmaildiscussreport

102views more COMBINATORICS 1999»

Critical Subgraphs of a Random Graph

13 years 10 months ago

Critical Subgraphs of a Random Graph

Download www.combinatorics.org

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.

Michael Molloy, Bruce A. Reed

Real-time Traffic

COMBINATORICS 1999 | Mathematics Subject Classification | Necessary Condition | Random Graph |

claim paper

Related Content

» Efficient algorithms for finding critical subgraphs

» Finding the chromatic number by means of critical graphs

» The Giant Component in a Random Subgraph of a Given Graph

» Approximation algorithm for knode connected subgraphs via critical graphs

» Excluding induced subgraphs Critical graphs

» Regular induced subgraphs of a random Graph

» 3star factors in random dregular graphs

» The number of possibilities for random dating

» Sparse random graphs with clustering

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COMBINATORICS
Authors	Michael Molloy, Bruce A. Reed

Comments (0)