Towards the reconstruction of posets

DOI10.1007/BF01108765zbMath0819.06002OpenAlexW2082138862MaRDI QIDQ1842096

Dieter Kratsch, Jean-Xavier Rampon

Publication date: 24 August 1995

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

reconstructionKelly lemmarecognizable class of posetsreconstructible parameter

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 (10)

A counterexample about poset reconstruction ⋮ Width two posets are reconstructible ⋮ Bipartite operator decomposition of graphs and the reconstruction conjecture ⋮ Reconstruction of finite truncated semi-modular lattices ⋮ Ordered sets that are reconstructible from two cards and the number of comparabilities. ⋮ What is reconstruction for ordered sets? ⋮ Pseudo-similar points in ordered sets ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Reconstruction of posets with the same comparability graph ⋮ More examples on ordered set reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructibility and perfect graphs
• A congruence theorem for trees
• Complement reducible graphs
• A counterexample about poset reconstruction
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• On the complexity of graph reconstruction

This page was built for publication: Towards the reconstruction of posets