The number of nonisomorphic posets having 12 elements

DOI10.1016/0304-3975(94)90070-1zbMath0791.06008OpenAlexW2036253679MaRDI QIDQ1314405

Claude Chaunier, Nik Lygeros

Publication date: 3 March 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90070-1

zbMATH Keywords

algorithmnumber of nonisomorphic posets having 12 elements

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Related Items

Enumeration and 3D representation of the stereo-isomers of alkane molecules ⋮ Advanced results in enumeration of hyperstructures.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting unlabeled structures
• New results from an algorithm for counting posets
• A Machine Representation of Finite T ₀ Topologies
• The NP-completeness column: an ongoing guide
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations