Height counting of unlabeled interval and \(N\)-free posets.

DOI10.1016/S0012-365X(03)00106-7zbMath1034.06003MaRDI QIDQ1420594

Soheir Mohamed Khamis

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(N\)-freeEnumerationCountingInterval orderHeight

Mathematics Subject Classification ID

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

Related Items (9)

Generation and enumeration of some classes of interval orders ⋮ On a conjecture about enumerating \((2+2)\)-free posets ⋮ Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics ⋮ Counting general and self-dual interval orders ⋮ Catalan pairs and Fishburn triples ⋮ Exact counting of unlabeled rigid interval posets regarding or disregarding height ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ Unnamed Item ⋮ Linear extensions of N-free orders.

Cites Work

• Asymptotic enumeration of N-free partial orders
• New results from an algorithm for counting posets
• Counting two-dimensional posets
• Enumeration of series-parallel posets according to heights
• Counting Interval Graphs
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Intransitive Indifference in Preference Theory: A Survey
• The number of unlabeled orders on fourteen elements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Height counting of unlabeled interval and \(N\)-free posets.