DC FieldValueLanguage
dc.contributor.authorAllen, Peter-
dc.contributor.authorBöttcher, Julia-
dc.contributor.authorEhrenmüller, Julia-
dc.contributor.authorTaraz, Anusch-
dc.date.accessioned2021-11-08T09:58:47Z-
dc.date.available2021-11-08T09:58:47Z-
dc.date.issued2015-11-12-
dc.identifier.citationElectronic Notes in Discrete Mathematics 49: 513-521 (2015-11)de_DE
dc.identifier.issn1571-0653de_DE
dc.identifier.urihttp://hdl.handle.net/11420/10812-
dc.description.abstractFor each real γ>0 and integers δ≥2 and k≥1, we prove that there exist constants β>0 and C>0 such that for all p≥C(logn/n)1/δ the random graph G(n, p) asymptotically almost surely contains - even after an adversary deletes an arbitrary (1/k-γ)-fraction of the edges at every vertex - a copy of every n-vertex graph with maximum degree at most δ, bandwidth at most βn and at least Cmaxp-2, p-1logn vertices not in triangles.en
dc.language.isoende_DE
dc.publisherElsevier Sciencede_DE
dc.relation.ispartofElectronic notes in discrete mathematicsde_DE
dc.subjectExtremal graph theoryde_DE
dc.subjectRandom graphsde_DE
dc.subjectResiliencede_DE
dc.subjectSparse regularityde_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleLocal resilience of spanning subgraphs in sparse random graphsde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishFor each real γ>0 and integers δ≥2 and k≥1, we prove that there exist constants β>0 and C>0 such that for all p≥C(logn/n)1/δ the random graph G(n, p) asymptotically almost surely contains - even after an adversary deletes an arbitrary (1/k-γ)-fraction of the edges at every vertex - a copy of every n-vertex graph with maximum degree at most δ, bandwidth at most βn and at least Cmaxp-2, p-1logn vertices not in triangles.de_DE
tuhh.publisher.doi10.1016/j.endm.2015.06.071-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.volume49de_DE
tuhh.container.startpage513de_DE
tuhh.container.endpage521de_DE
dc.identifier.scopus2-s2.0-84947722533de_DE
local.status.inpressfalsede_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.languageiso639-1en-
item.grantfulltextnone-
item.creatorOrcidAllen, Peter-
item.creatorOrcidBöttcher, Julia-
item.creatorOrcidEhrenmüller, Julia-
item.creatorOrcidTaraz, Anusch-
item.mappedtypeArticle-
item.creatorGNDAllen, Peter-
item.creatorGNDBöttcher, Julia-
item.creatorGNDEhrenmüller, Julia-
item.creatorGNDTaraz, Anusch-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0002-4104-3635-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

33
Last Week
0
Last month
checked on Aug 8, 2022

SCOPUSTM   
Citations

1
Last Week
0
Last month
checked on Jun 30, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.