An exact enumeration of the unlabeled disconnected posets
From MaRDI portal
Publication:5094086
Authors: Salah Uddin Mohammad, M.D. Shah Noor, M. R. Talukder 
Publication date: 2 August 2022
Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL25/Uddin/uddin6.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Calculation of integer sequences (11Y55)
Cites Work
- Title not available (Why is that?)
- Enumeration and limit laws for series-parallel graphs
- Title not available (Why is that?)
- Height counting of unlabeled interval and \(N\)-free posets.
- Posets on up to 16 points
- On the cardinalities of finite topologies and the number of antichains in partially ordered sets
- Title not available (Why is that?)
- The number of orders with thirteen elements
- The number of unlabeled orders on fourteen elements
- On numerical counting of prime, UPO, and the general type of posets according to heights
- Title not available (Why is that?)
- Recognition of prime posets and one of its applications
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)
