Böttcher, Julia, 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
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.
|Additional Information:||© 2009 Elsevier B.V.|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
|Date Deposited:||28 May 2012 15:26|
Actions (login required)
|Record administration - authorised staff only|