DC Field | Value | Language |
---|---|---|
dc.contributor.author | Joos, Felix | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.date.accessioned | 2020-12-31T02:10:22Z | - |
dc.date.available | 2020-12-31T02:10:22Z | - |
dc.date.created | 2020-06-02 | - |
dc.date.created | 2020-06-02 | - |
dc.date.created | 2020-06-02 | - |
dc.date.created | 2020-06-02 | - |
dc.date.created | 2020-06-02 | - |
dc.date.issued | 2020-06 | - |
dc.identifier.citation | BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, v.52, no.3, pp.498 - 504 | - |
dc.identifier.issn | 0024-6093 | - |
dc.identifier.uri | http://hdl.handle.net/10203/279378 | - |
dc.description.abstract | For a collection G={G1,MIDLINE HORIZONTAL ELLIPSIS,Gs} of not necessarily distinct graphs on the same vertex set V, a graph H with vertices in V is a G-transversal if there exists a bijection phi:E(H)->[s] such that e is an element of E(G phi(e)) for all e is an element of E(H). We prove that for |V|=s > 3 and delta(Gi)> s/2 for each i is an element of[s], there exists a G-transversal that is a Hamilton cycle. This confirms a conjecture of Aharoni. We also prove an analogous result for perfect matchings. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | On a rainbow version of Dirac's theorem | - |
dc.type | Article | - |
dc.identifier.wosid | 000533659400001 | - |
dc.identifier.scopusid | 2-s2.0-85085014112 | - |
dc.type.rims | ART | - |
dc.citation.volume | 52 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 498 | - |
dc.citation.endingpage | 504 | - |
dc.citation.publicationname | BULLETIN OF THE LONDON MATHEMATICAL SOCIETY | - |
dc.identifier.doi | 10.1112/blms.12343 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Joos, Felix | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | 05C38 | - |
dc.subject.keywordAuthor | 05C45 | - |
dc.subject.keywordAuthor | 05C70 (primary) | - |
dc.subject.keywordPlus | MATCHINGS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.