DC Field | Value | Language |
---|---|---|
dc.contributor.author | Joos, Felix | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.date.accessioned | 2019-12-20T07:20:09Z | - |
dc.date.available | 2019-12-20T07:20:09Z | - |
dc.date.created | 2019-10-31 | - |
dc.date.created | 2019-10-31 | - |
dc.date.created | 2019-10-31 | - |
dc.date.created | 2019-10-31 | - |
dc.date.created | 2019-10-31 | - |
dc.date.created | 2019-10-31 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.citation | RANDOM STRUCTURES & ALGORITHMS, v.56, no.1, pp.169 - 219 | - |
dc.identifier.issn | 1042-9832 | - |
dc.identifier.uri | http://hdl.handle.net/10203/270072 | - |
dc.description.abstract | A classical result of Komlos, Sarkozy, and Szemeredi states that every n-vertex graph with minimum degree at least (1/2 + o(1))n contains every n-vertex tree with maximum degree O(n/logn). Krivelevich, Kwan, and Sudakov proved that for every n-vertex graph G(alpha) with minimum degree at least alpha n for any fixed alpha > 0 and every n-vertex tree T with bounded maximum degree, one can still find a copy of T in G(alpha) with high probability after adding O(n) randomly chosen edges to G(alpha). We extend the latter results to trees with (essentially) unbounded maximum degree; for a given no(1)<=Delta <= cn/logn and alpha > 0, we determine up to a constant factor the number of random edges that we need to add to an arbitrary n-vertex graph with minimum degree alpha n in order to guarantee with high probability a copy of any fixed n-vertex tree with maximum degree at most Delta. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | Spanning trees in randomly perturbed graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000490511700001 | - |
dc.identifier.scopusid | 2-s2.0-85074082940 | - |
dc.type.rims | ART | - |
dc.citation.volume | 56 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 169 | - |
dc.citation.endingpage | 219 | - |
dc.citation.publicationname | RANDOM STRUCTURES & ALGORITHMS | - |
dc.identifier.doi | 10.1002/rsa.20886 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Joos, Felix | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Random graphs | - |
dc.subject.keywordAuthor | trees | - |
dc.subject.keywordAuthor | graph embedding | - |
dc.subject.keywordPlus | SMOOTHED ANALYSIS | - |
dc.subject.keywordPlus | RANDOM EDGES | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.