Almost spanning subgraphs of random graphs after adversarial edge removal - Mathematics > CombinatoricsReportar como inadecuado




Almost spanning subgraphs of random graphs after adversarial edge removal - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Let Delta>1 be a fixed integer. We show that the random graph Gn,p withp>>log n-n^{1-Delta} is robust with respect to the containment of almostspanning bipartite graphs H with maximum degree Delta and sublinear bandwidthin the following sense: asymptotically almost surely, if an adversary deletesarbitrary edges in Gn,p such that each vertex loses less than half of itsneighbours, then the resulting graph still contains a copy of all such H.



Autor: Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz

Fuente: https://arxiv.org/







Documentos relacionados