Cites work
Cited in
(7)- A use for frequently rediscovering a concept
- Counting finite posets and topologies
- A generalized permutahedron
- Maximal chains of preorders
- New results from an algorithm for counting posets
- The number of partially ordered sets with more points than incomparable pairs
- The average number of linear extensions of a partial order
This page was built for publication: The lattice of natural partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556873)