On the pagenumber of complete bipartite graphs

Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota

研究成果: Article

30 引用 (Scopus)

抜粋

The pagenumberp(G) of a graphGis defined as the smallestnsuch thatGcan be embedded in a book withnpages. We give an upper bound for the page-number of the complete bipartite graphKm,n. Among other things, we provep(Kn,n)≤⌊2n/3⌋+1 andp(K⌊n2/4⌋,n)≤n-1. We also give an asymptotic result: min{m:p(Km,n)=n}=n2/4+O(n7/4).

元の言語English
ページ(範囲)111-120
ページ数10
ジャーナルJournal of Combinatorial Theory. Series B
71
発行部数1
DOI
出版物ステータスPublished - 1997 9 1

    フィンガープリント

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

これを引用