Width two posets are reconstructible

DOI10.1016/0012-365X(95)00295-8MaRDI QIDQ1356683zbMATH OpenFDO

Authors Dieter Kratsch, Jean-Xavier Rampon

Publication date 5 November 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

reconstructiondeck of a posetwidth 4width two posets

Mathematics Subject Classification ID

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

Recommendations

• Towards the reconstruction of posets
• Ordered sets that are reconstructible from two cards and the number of comparabilities.
• Reconstruction of posets with the same comparability graph

Cites work

• scientific article; zbMATH DE number 417290 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 887768 (Why is no real title available?)
• A counterexample about poset reconstruction
• Graph reconstruction—a survey
• On the Structure of Finite T₀ + T₅ Spaces
• The falsity of the reconstruction conjecture for tournaments
• Towards the reconstruction of posets

Cited in

(3)

• Reconstruction of finite truncated semi-modular lattices
• What is reconstruction for ordered sets?
• More examples on ordered set reconstruction

This page was built for publication: Width two posets are reconstructible

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