An exact enumeration of the unlabeled disconnected posets
From MaRDI portal
Publication:5094086
Recommendations
- New results from an algorithm for counting posets
- scientific article; zbMATH DE number 1156638
- Height counting of unlabeled interval and \(N\)-free posets.
- The number of partially ordered sets with more points than incomparable pairs
- Exact counting of unlabeled rigid interval posets regarding or disregarding height
Cites Work
- scientific article; zbMATH DE number 653240 (Why is no real title available?)
- scientific article; zbMATH DE number 1156638 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- Enumeration and limit laws for series-parallel graphs
- Height counting of unlabeled interval and \(N\)-free posets.
- On numerical counting of prime, UPO, and the general type of posets according to heights
- On the cardinalities of finite topologies and the number of antichains in partially ordered sets
- Posets on up to 16 points
- Recognition of prime posets and one of its applications
- The number of orders with thirteen elements
- The number of unlabeled orders on fourteen elements
Cited In (1)
Uses Software
This page was built for publication: An exact enumeration of the unlabeled disconnected posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094086)