AbstractLet 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.
|Keywords||Partially ordered sets, N-free posets, series-parallel posets, asymptotic enumeration.||Issue Date||1-Sep-1989||Journal||Order||URI||http://research.asu.edu.eg/123456789/1126||DOI||3
Recommend this item
|Asymptotic Enumeration of N-Free Partial Orders.pdf||338.63 kB||Adobe PDF||View/Open|
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.