The number of graded partially ordered sets

DOI10.1016/S0021-9800(69)80100-6MaRDI QIDQ5556471zbMATH OpenFDO

Authors David A. Klarner

Publication date 1969

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(69)80100-6

zbMATH Keywords

ordered sets, lattices

Cited in

(15)

• The number of tiered posets modulo six
• Counting finite posets and topologies
• Structural and numerical studies of some topological properties for Alexandroff spaces
• The number of partially ordered sets
• Height on posets and graphs
• The lattice of natural partial orders
• Enumeration of graded (3+1)-avoiding posets
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Counting finite posets
• On some topological properties in the class of Alexandroff spaces
• Basic retracts and counting of lattices
• The Number of Finite Topologies
• Quantifying robustness of the gap gene network
• Dénombrement des ordres étagés
• Periodicity of residues of the number of finite labeled topologies

This page was built for publication: The number of graded partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5556471)