Asymptotic enumeration of N-free partial orders
Bayoumi B.; El-Zahar M.; Khamis, Soheir;
Abstract
Let N(n) and N * (n) denote, respectively, the number of unlabeled and labeled N-free posets with n elements. It is proved that N(n)=2 n log n+o(n log n) and N * (n)=2 2 n log n+o(n log n) . This is obtained by considering the class of N-free interval posets which can be easily counted. © 1989 Kluwer Academic Publishers.
Other data
| Title | Asymptotic enumeration of N-free partial orders | Authors | Bayoumi B. ; El-Zahar M. ; Khamis, Soheir | Keywords | Partially ordered sets, N-free posets, series-parallel posets, asymptotic enumeration. | Issue Date | 1-Sep-1989 | Journal | Order | DOI | 3 https://api.elsevier.com/content/abstract/scopus_id/0346387881 219 6 10.1007/BF00563522 |
Scopus ID | 2-s2.0-0346387881 |
Attached Files
| File | Description | Size | Format | |
|---|---|---|---|---|
| Asymptotic Enumeration of N-Free Partial Orders.pdf | 338.63 kB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.