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

DOI10.1007/s11083-013-9306-4zbMath1318.06003OpenAlexW2090587954MaRDI QIDQ466874

Bernd S. W. Schröder

Publication date: 31 October 2014

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-013-9306-4

zbMATH Keywords

reconstruction problemordered sets2-cardsisomorphic cardsorder reconstruction

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-similar points in ordered sets
• Constructing graphs with pairs of pseudo-similar vertices
• A counterexample about poset reconstruction
• On ordered sets with isomorphic marked maximal cards
• What is reconstruction for ordered sets?
• More examples on ordered set reconstruction
• Towards the reconstruction of posets
• Examples on ordered set reconstruction
• Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
• Almost every graph has reconstruction number three
• Graph reconstruction—a survey

This page was built for publication: Ordered sets that are reconstructible from two cards and the number of comparabilities.