Local resilience of graphs

: In this article, 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) to destroy P. Estimating the resilience leads to many new and challenging problems. Here we focus on random and pseudorandom graphs and prove several sharp results.

• Type: Journal
• Year: 2008
• Where: RSA
• Authors: Benny Sudakov, Van H. Vu
• Keywords: Graph Resilience, Resilience, RSA 2008, Systematic Study