Dismantling sparse random graphs

Details Dismantling sparse random graphs Dismantling sparse random graphs

2007-09-12

arxiv.org/abs/0709.1787v1

Mathematics

Combinatorics

7 pages

Scientific paper

We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).

Affiliated with

Also associated with

No associations

Rating

Dismantling sparse random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dismantling sparse random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dismantling sparse random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22004