More examples on ordered set reconstruction

DOI10.1016/j.disc.2003.06.009zbMath1048.06002OpenAlexW1973694916MaRDI QIDQ1827677

Bernd S. W. Schröder

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.009

zbMATH Keywords

ordered setreconstructionmaximal cardminimal card

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Ordered sets that are reconstructible from two cards and the number of comparabilities.

Cites Work

• A counterexample about poset reconstruction
• Width two posets are reconstructible
• Reconstruction of finite truncated semi-modular lattices
• Towards the reconstruction of posets
• Examples on ordered set reconstruction
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Reconstruction of the neighborhood deck of an ordered set

This page was built for publication: More examples on ordered set reconstruction