Asymptotic enumeration of N-free partial orders

DOI10.1007/BF00563522zbMath0701.06004OpenAlexW2010697617MaRDI QIDQ913831

Mohamed H. El-Zahar, Soheir Mohamed Khamis, Bayoumi I. Bayoumi

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00563522

zbMATH Keywords

generating functionasymptotic enumerationcovering graph of a posetN-free interval ordersN-free posetsseries-parallel posets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30)

Related Items (3)

Height counting of unlabeled interval and \(N\)-free posets. ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ Exact counting of unlabeled rigid interval posets regarding or disregarding height

Cites Work

• Unnamed Item
• Unnamed Item
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Counting two-dimensional posets
• Optimal Linear Extensions by Interchanging Chains
• The Recognition of Series Parallel Digraphs
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Maximal chains and antichains

This page was built for publication: Asymptotic enumeration of N-free partial orders