DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Choongbum | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2016-06-07T09:17:00Z | - |
dc.date.available | 2016-06-07T09:17:00Z | - |
dc.date.created | 2015-12-24 | - |
dc.date.created | 2015-12-24 | - |
dc.date.created | 2015-12-24 | - |
dc.date.issued | 2015-10 | - |
dc.identifier.citation | SIAM JOURNAL ON DISCRETE MATHEMATICS, v.29, no.4, pp.1999 - 2005 | - |
dc.identifier.issn | 0895-4801 | - |
dc.identifier.uri | http://hdl.handle.net/10203/207863 | - |
dc.description.abstract | We prove that for all positive integers t, every n-vertex graph with no K-t-subdivision has at most 2(50t)n cliques. We also prove that asymptotically, such graphs contain at most 2(5+o(1))t(n) cliques, where o(1) tends to zero as t tends to infinity. This strongly answers a question of Wood that asks whether the number of cliques in n-vertex graphs with no K-t-minor is at most 2(ct)n for some constant c. | - |
dc.language | English | - |
dc.publisher | SIAM PUBLICATIONS | - |
dc.title | NUMBER OF CLIQUES IN GRAPHS WITH A FORBIDDEN SUBDIVISION | - |
dc.type | Article | - |
dc.identifier.wosid | 000367020100011 | - |
dc.identifier.scopusid | 2-s2.0-84953309429 | - |
dc.type.rims | ART | - |
dc.citation.volume | 29 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 1999 | - |
dc.citation.endingpage | 2005 | - |
dc.citation.publicationname | SIAM JOURNAL ON DISCRETE MATHEMATICS | - |
dc.identifier.doi | 10.1137/140979988 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Lee, Choongbum | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | minor | - |
dc.subject.keywordAuthor | topological minor | - |
dc.subject.keywordAuthor | subdivision | - |
dc.subject.keywordAuthor | clique | - |
dc.subject.keywordPlus | MAXIMUM NUMBER | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.