Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Taraz, Anusch
(2009)
*Almost spanning subgraphs of random graphs after adversarial edge removal.*
Electronic Notes in Discrete Mathematics, 35.
pp. 335-340.
ISSN 1571-0653

Identification Number: 10.1016/j.endm.2009.11.055

## Abstract

Let Δ⩾2 be a fixed integer. We show that the random graph Gn,p with p⩾c(logn/n)1/Δ is robust with respect to the containment of almost spanning bipartite graphs H with maximum degree Δ and sublinear bandwidth in the following sense. If an adversary deletes arbitrary edges in Gn,p such that each vertex loses less than half of its neighbours, then asymptotically almost surely the resulting graph still contains a copy of H.

Item Type: | Article |
---|---|

Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |

Additional Information: | © 2009 Elsevier B.V. |

Divisions: | Mathematics |

Subjects: | Q Science > QA Mathematics |

Date Deposited: | 28 May 2012 15:26 |

Last Modified: | 16 May 2024 00:58 |

URI: | http://eprints.lse.ac.uk/id/eprint/44108 |

### Actions (login required)

View Item |