The number of orders with thirteen elements

DOI10.1007/BF00383943MaRDI QIDQ1207714zbMATH OpenFDO

Authors Claude Chaunier, Nik Lygeros

Publication date 16 May 1993

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00383943

zbMATH Keywords

enumerationnumber of posets on 13 elements

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to ordered structures (06-04) Combinatorics of partially ordered sets (06A07)

Recommendations

• The number of nonisomorphic posets having 12 elements
• The number of unlabeled orders on fourteen elements
• Counting linear extension majority cycles in partially ordered sets on up to 13 elements
• New results from an algorithm for counting posets
• Posets on up to 16 points

Cites work

• scientific article; zbMATH DE number 25381 (Why is no real title available?)
• scientific article; zbMATH DE number 39343 (Why is no real title available?)
• New results from an algorithm for counting posets
• The number of partially ordered sets with more points than incomparable pairs

Cited in

(9)

• The number of nonisomorphic posets having 12 elements
• Stanley's non-Ehrhart-positive order polytopes
• Enumeration and 3D representation of the stereo-isomers of alkane molecules
• scientific article; zbMATH DE number 3985224 (Why is no real title available?)
• scientific article; zbMATH DE number 897250 (Why is no real title available?)
• An exact enumeration of the unlabeled disconnected posets
• Basic retracts and counting of lattices
• The number of unlabeled orders on fourteen elements
• Advanced results in enumeration of hyperstructures.

This page was built for publication: The number of orders with thirteen elements

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