DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Kuhn, Daniela | ko |
dc.contributor.author | Kupavskii, Andrey | ko |
dc.contributor.author | Osthus, Deryk | ko |
dc.date.accessioned | 2020-12-31T02:10:19Z | - |
dc.date.available | 2020-12-31T02:10:19Z | - |
dc.date.created | 2020-01-29 | - |
dc.date.created | 2020-01-29 | - |
dc.date.created | 2020-01-29 | - |
dc.date.created | 2020-01-29 | - |
dc.date.created | 2020-01-29 | - |
dc.date.issued | 2020-07 | - |
dc.identifier.citation | RANDOM STRUCTURES & ALGORITHMS, v.56, no.4, pp.1171 - 1204 | - |
dc.identifier.issn | 1042-9832 | - |
dc.identifier.uri | http://hdl.handle.net/10203/279377 | - |
dc.description.abstract | We study approximate decompositions of edge-colored quasirandom graphs into rainbow spanning structures: an edge-coloring of a graph is locallyl-bounded if every vertex is incident to at most l edges of each color, and is (globally) g-boundedif every color appears at most g times. Our results imply the existence of: (1) approximate decompositions of properly edge-colored Kn into rainbow almost-spanning cycles; (2) approximate decompositions of edge-colored Kn into rainbow Hamilton cycles, provided that the coloring is (1-o(1))n2-bounded and locally o(nlog4n)-bounded; and (3) an approximate decomposition into full transversals of any nxn array, provided each symbol appears (1-o(1))n times in total and only o(nlog2n) times in each row or column. Apart from the logarithmic factors, these bounds are essentially best possible. We also prove analogues for rainbow F-factors, where F is any fixed graph. Both (1) and (2) imply approximate versions of the Brualdi-Hollingsworth conjecture on decompositions into rainbow spanning trees. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | Rainbow structures in locally bounded colorings of graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000506815100001 | - |
dc.identifier.scopusid | 2-s2.0-85077859290 | - |
dc.type.rims | ART | - |
dc.citation.volume | 56 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 1171 | - |
dc.citation.endingpage | 1204 | - |
dc.citation.publicationname | RANDOM STRUCTURES & ALGORITHMS | - |
dc.identifier.doi | 10.1002/rsa.20902 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Kuhn, Daniela | - |
dc.contributor.nonIdAuthor | Kupavskii, Andrey | - |
dc.contributor.nonIdAuthor | Osthus, Deryk | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Hamilton cycles | - |
dc.subject.keywordAuthor | spanning trees | - |
dc.subject.keywordAuthor | rainbow colorings | - |
dc.subject.keywordAuthor | Latin squares | - |
dc.subject.keywordPlus | PARTIAL TRANSVERSAL | - |
dc.subject.keywordPlus | TREES | - |
dc.subject.keywordPlus | SUBGRAPHS | - |
dc.subject.keywordPlus | LENGTH | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.