Title of article
On the Pagenumber of Complete Bipartite Graphs
Author/Authors
Enomoto، نويسنده , , Hikoe and Nakamigawa، نويسنده , , Tomoki and Ota، نويسنده , , Katsuhiro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
10
From page
111
To page
120
Abstract
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).
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526293
Link To Document