New results from an algorithm for counting posets

DOI10.1007/BF00383201MaRDI QIDQ1177709zbMATH OpenFDO

Authors J. Culberson, Gregory J. E. Rawlins

Publication date 26 June 1992

Published in Order (Search for Journal in Brave)

zbMATH Keywords

algorithmrecurrencescomputer enumeration of partial ordersnumber of natural partial ordersnumber of partial ordersposet of posets

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Combinatorics of partially ordered sets (06A07) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Recommendations

• The number of unlabeled orders on fourteen elements
• scientific article; zbMATH DE number 1156638
• The number of nonisomorphic posets having 12 elements
• On recursion relations in the problem of enumeration of posets

Cites work

• scientific article; zbMATH DE number 3841924 (Why is no real title available?)
• scientific article; zbMATH DE number 6157245 (Why is no real title available?)
• A Machine Representation of Finite T ₀ Topologies
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• Note on Finite Topological Spaces
• On the cardinalities of finite topologies and the number of antichains in partially ordered sets
• On the computer enumeration of finite topologies
• Orderly algorithms for generating restricted classes of graphs
• Producing posets
• The lattice of natural partial orders
• The number of partially ordered sets with more points than incomparable pairs

Cited in

(17)

• On recursion relations in the problem of enumeration of posets
• The number of orders with thirteen elements
• On the poset of all posets on \(n\) elements
• Height counting of unlabeled interval and \(N\)-free posets.
• On numerical counting of prime, UPO, and the general type of posets according to heights
• scientific article; zbMATH DE number 1156638 (Why is no real title available?)
• A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
• Recognition of prime posets and one of its applications
• Counting finite posets and topologies
• scientific article; zbMATH DE number 2052742 (Why is no real title available?)
• scientific article; zbMATH DE number 6375591 (Why is no real title available?)
• Efficiently counting representations of finite posets
• The number of nonisomorphic posets having 12 elements
• On recurrence relation in the problem of enumeration of finite posets
• The number of partially ordered sets with more points than incomparable pairs
• Partition coefficients of acyclic graphs
• Posets on up to 16 points

This page was built for publication: New results from an algorithm for counting posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177709)