✦ LIBER ✦

Asymptotic enumeration of two-dimensional posets

✍ Scribed by M. El-Zahar; N. W. Sauer

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 271 KB
Volume: 5
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00354891

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we show that the number of pairwise nonisomorphic two-dimensional posets with n elements is asymptotically equivalent to =l n!. This estimate is based on a characterization, in terms of structural decomposmon, of two-d~mensmnal posets having a umque rep~*sentation as the intersection of two linear extensions• AMS subject classification (1980). 06A 10.

📜 SIMILAR VOLUMES

Counting two-dimensional posets

✍ Bayoumi I. Bayoumi; Mohamed H. El-Zahar; Soheir M. Khamis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 482 KB

The number of unlabeled 2-dimensional posets is recursively calculated. This counting makes use of the relationship between permutations and posets of dimension two.

Asymptotic enumeration of cographs

✍ Vlady Ravelomanana; Loÿs Thimonier 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Asymptotic Enumeration of Convex Polygon

Asymptotic Enumeration of Convex Polygons

✍ Dudley Stark; Nicholas C. Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A polygon is an elementary (self-avoiding) cycle in the hypercubic lattice Z d taking at least one step in every dimension. A polygon on Z d is said to be convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. The number of d-dimensional convex pol

Asymptotic enumeration of full graphs

✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo

On building the transitive reduction of

On building the transitive reduction of a two-dimensional poset

✍ Enrico Nardelli; Vincenzo Mastrobuoni; Alesiano Santomo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper we provide an efficient algorithm for computing the graph representing the transitive reduction of a two-dimensional poset which is given by means of the two linear extensions realizing it. @

Asymptotic enumeration of generalized la

Asymptotic enumeration of generalized latin rectangles

✍ Timothy A Green 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 428 KB