The number of partially ordered sets

DOI10.1016/0095-8956(72)90064-0zbMath0231.05008OpenAlexW2008659194MaRDI QIDQ2550392

Kim Hang Kim

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90064-0

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Related Items

The publications of Ki Hang Kim ⋮ Idempotent Boolean matrices ⋮ Counting finite posets and topologies ⋮ Riordan posets and associated incidence matrices ⋮ The semigroup of Hall relations ⋮ Counting finite posets ⋮ A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets ⋮ A generalization of a theorem of Erné about the number of posets with a fixed antichain ⋮ Combinatorial properties of binary semigroups ⋮ Periodicity of residues of the number of finite labeled topologies ⋮ Logics of order and related notions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Canonical bijection between \(D\)-classes of (0,1)-matrix semigroups
• On \((0.1)\)-matrix semigroups
• The number of idempotents in (0,1)-matrix semigroups
• The number of graded partially ordered sets
• A generalization of Sperner's lemma
• The number of classes of isomorphic graded partially ordered sets
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries
• Ideals in Partially Ordered Sets
• On the semigroup of binary relations