论文信息 - Ordered sets, pagenumbers and planarity

Ordered sets, pagenumbers and planarity

General bounds for the pagenumber of an ordered set are developed. One bound is derived by first showing that the maximum number of edges in the diagram of a planar ordered setP is 2v(P)-2-ht(P). A construction is given to show that the pagenumber of the product ofn chains is no more than 2n-2. Lastly, some open questions are discussed.

Richard J. Nowakowski | Andrew Parker | R. Nowakowski | A. Parker

[1] Paul C. Kainen,et al. The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[2] David E. Daykin,et al. Ordered Ranked Posets, Representations of Integers and Inequalities from Extremal Poset Problems , 1985 .

[3] R. P. Dilworth,et al. Algebraic theory of lattices , 1973 .

[4] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[5] Arnold L. Rosenberg,et al. Diogenes, Circa 1986 , 1986, Aegean Workshop on Computing.

[6] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[7] Roland Jégou,et al. The diagram invariant problem for planar lattices , 1987 .