Mathematics – Combinatorics
Scientific paper
2007-06-27
Mathematics
Combinatorics
Scientific paper
In this paper, we initiate a systematic study of graph resilience. The
(local) resilience of a graph G with respect to a property P measures how much
one has to change G (locally) in order to destroy P. Estimating the resilience
leads to many new and challenging problems. Here we focus on random and
pseudo-random graphs and prove several sharp results.
Sudakov Benny
Vu Van
No associations
LandOfFree
Local resilience of 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 Local resilience of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local resilience of graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-455885