Ordered sets that are reconstructible from two cards and the number of comparabilities.
From MaRDI portal
Publication:466874
DOI10.1007/S11083-013-9306-4zbMATH Open1318.06003OpenAlexW2090587954MaRDI QIDQ466874FDOQ466874
Authors: Bernd 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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorics of partially ordered sets (06A07)
Cites Work
- Graph reconstruction—a survey
- Towards the reconstruction of posets
- Almost every graph has reconstruction number three
- Constructing graphs with pairs of pseudo-similar vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- What is reconstruction for ordered sets?
- Title not available (Why is that?)
- Examples on ordered set reconstruction
- A counterexample about poset reconstruction
- On ordered sets with isomorphic marked maximal cards
- More examples on ordered set reconstruction
- Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
- Title not available (Why is that?)
- Pseudo-similar points in ordered sets
Cited In (8)
- Title not available (Why is that?)
- Reconstruction of N-free ordered sets
- What is reconstruction for ordered sets?
- Disconnected ordered sets are max-reconstructible
- Pseudo-similar points in ordered sets
- Reconstruction of posets with the same comparability graph
- On ordered sets with isomorphic marked maximal cards
- More examples on ordered set reconstruction
This page was built for publication: Ordered sets that are reconstructible from two cards and the number of comparabilities.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466874)
