The number of partially ordered sets with more points than incomparable pairs
type: Item
instance of: scholarly article
title: The number of partially ordered sets with more points than incomparable pairs
zbMATH Open document ID: 0761.06004
DOI: 10.1016/0012-365X(92)90131-X
author: Marcel Erné
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 94346
zbMATH Keywords: unlabeled posets
zbMATH Keywords: unrelated pairs
zbMATH Keywords: recursion formula
zbMATH Keywords: polynomials
zbMATH Keywords: linear extension
MaRDI profile type: Publication
cites work: The lattice of natural partial orders
cites work: New results from an algorithm for counting posets
cites work: Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
Wikidata QID: Q127972335
description: scientific article; zbMATH DE number 94346