DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Choongbum | ko |
dc.contributor.author | Lee, Joonkyung | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2013-03-12T18:38:59Z | - |
dc.date.available | 2013-03-12T18:38:59Z | - |
dc.date.created | 2012-08-08 | - |
dc.date.created | 2012-08-08 | - |
dc.date.created | 2012-08-08 | - |
dc.date.issued | 2012-07 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.70, no.3, pp.339 - 347 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/103163 | - |
dc.description.abstract | Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour [J Combin Theory Ser B 96 (2006), 514528]. We investigate the asymptotic behavior of rank-width of a random graph G(n, p). We show that, asymptotically almost surely, (i) if p?(0, 1) is a constant, then rw(G(n, p)) = ?n/3?-O(1), (ii) if , then rw(G(n, p)) = ?1/3?-o(n), (iii) if p = c/n and c>1, then rw(G(n, p))?rn for some r = r(c), and (iv) if p?c/n and c81, then rw(G(n, p))?2. As a corollary, we deduce that the tree-width of G(n, p) is linear in n whenever p = c/n for each c>1, answering a question of Gao [2006]. (c) 2011 Wiley Periodicals, Inc. J Graph Theory. | - |
dc.language | English | - |
dc.publisher | WILEY-BLACKWELL | - |
dc.title | Rank-width of random graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000305515100007 | - |
dc.identifier.scopusid | 2-s2.0-84862846785 | - |
dc.type.rims | ART | - |
dc.citation.volume | 70 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 339 | - |
dc.citation.endingpage | 347 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.20620 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Lee, Choongbum | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | rank-width | - |
dc.subject.keywordAuthor | tree-width | - |
dc.subject.keywordAuthor | clique-width | - |
dc.subject.keywordAuthor | random graph | - |
dc.subject.keywordAuthor | sharp threshold | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | BRANCH-WIDTH | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.