DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Liu, Hong | ko |
dc.contributor.author | Sharifzadeh, Maryam | ko |
dc.contributor.author | Staden, Katherine | ko |
dc.date.accessioned | 2019-07-18T05:34:14Z | - |
dc.date.available | 2019-07-18T05:34:14Z | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.issued | 2017-11 | - |
dc.identifier.citation | PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, v.115, pp.974 - 1013 | - |
dc.identifier.issn | 0024-6115 | - |
dc.identifier.uri | http://hdl.handle.net/10203/263344 | - |
dc.description.abstract | Komlos conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph Kd+1 minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when d is sufficiently large. In fact we prove a stronger result: for large d, any graph G with average degree at least d contains almost twice as many Hamiltonian subsets as Kd+1, unless G is isomorphic to Kd+1 or a certain other graph which we specify. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | Proof of Komlos's conjecture on Hamiltonian subsets | - |
dc.type | Article | - |
dc.identifier.wosid | 000417270500002 | - |
dc.identifier.scopusid | 2-s2.0-85024376170 | - |
dc.type.rims | ART | - |
dc.citation.volume | 115 | - |
dc.citation.beginningpage | 974 | - |
dc.citation.endingpage | 1013 | - |
dc.citation.publicationname | PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY | - |
dc.identifier.doi | 10.1112/plms.12059 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Liu, Hong | - |
dc.contributor.nonIdAuthor | Sharifzadeh, Maryam | - |
dc.contributor.nonIdAuthor | Staden, Katherine | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | REGULAR EXPANDERS | - |
dc.subject.keywordPlus | CYCLES | - |
dc.subject.keywordPlus | DECOMPOSITIONS | - |
dc.subject.keywordPlus | NUMBER | - |
dc.subject.keywordPlus | LEMMA | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.