DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Kuhn, Daniela | ko |
dc.contributor.author | Osthus, Deryk | ko |
dc.contributor.author | Tyomkyn, Mykhaylo | ko |
dc.date.accessioned | 2019-11-08T05:20:04Z | - |
dc.date.available | 2019-11-08T05:20:04Z | - |
dc.date.created | 2019-11-06 | - |
dc.date.created | 2019-11-06 | - |
dc.date.created | 2019-11-06 | - |
dc.date.created | 2019-11-06 | - |
dc.date.created | 2019-11-06 | - |
dc.date.issued | 2019-04 | - |
dc.identifier.citation | TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, v.371, no.7, pp.4655 - 4742 | - |
dc.identifier.issn | 0002-9947 | - |
dc.identifier.uri | http://hdl.handle.net/10203/268271 | - |
dc.description.abstract | We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to long-standing decomposition problems. For instance, our results imply the following. Let G be a quasi-random n-vertex graph and suppose H-1, ..., H-s are bounded degree n-vertex graphs with Sigma(s)(i=1) e(H-i) <= (1 -o(1))e(G). Then H-1, ..., H-s can be packed edge-disjointly into G. The case when G is the complete graph K-n implies an approximate version of the tree packing conjecture of Gyarfas and Lehel for bounded degree trees, and of the Oberwolfach problem. We provide a more general version of the above approximate decomposition result which can be applied to super-regular graphs and thus can be combined with Szemeredi's regularity lemma. In particular our result can be viewed as an extension of the classical blow-up lemma of Komlos, Sarkozy, and Szemeredi to the setting of approximate decompositions. | - |
dc.language | English | - |
dc.publisher | AMER MATHEMATICAL SOC | - |
dc.title | A BLOW-UP LEMMA FOR APPROXIMATE DECOMPOSITIONS | - |
dc.type | Article | - |
dc.identifier.wosid | 000463342400005 | - |
dc.identifier.scopusid | 2-s2.0-85065342815 | - |
dc.type.rims | ART | - |
dc.citation.volume | 371 | - |
dc.citation.issue | 7 | - |
dc.citation.beginningpage | 4655 | - |
dc.citation.endingpage | 4742 | - |
dc.citation.publicationname | TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY | - |
dc.identifier.doi | 10.1090/tran/7411 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Kuhn, Daniela | - |
dc.contributor.nonIdAuthor | Osthus, Deryk | - |
dc.contributor.nonIdAuthor | Tyomkyn, Mykhaylo | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | HAMILTON DECOMPOSITIONS | - |
dc.subject.keywordPlus | CYCLE DECOMPOSITIONS | - |
dc.subject.keywordPlus | REGULAR EXPANDERS | - |
dc.subject.keywordPlus | PACKING TREES | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.subject.keywordPlus | CONJECTURE | - |
dc.subject.keywordPlus | PROOF | - |
dc.subject.keywordPlus | BOLLOBAS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.