Local resilience of graphs
| dc.creator | Sudakov, Benny | |
| dc.creator | Vu, Van | |
| dc.date | 2007-06-27 | |
| dc.date | 2007-12-01 | |
| dc.date.accessioned | 2026-07-07T08:46:13Z | |
| dc.date.available | 2026-07-07T08:46:13Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0706.4104 | |
| dc.identifier | http://arxiv.org/abs/0706.4104 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143178 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.title | Local resilience of graphs | |
| dc.type | text |