More examples on ordered set reconstruction
From MaRDI portal
Publication:1827677
DOI10.1016/J.DISC.2003.06.009zbMATH Open1048.06002OpenAlexW1973694916MaRDI QIDQ1827677FDOQ1827677
Authors: Bernd 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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorics of partially ordered sets (06A07)
Cites Work
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Towards the reconstruction of posets
- Examples on ordered set reconstruction
- A counterexample about poset reconstruction
- Width two posets are reconstructible
- Reconstruction of finite truncated semi-modular lattices
- Reconstruction of the neighborhood deck of an ordered set
Cited In (6)
- Reconstruction of N-free ordered sets
- Disconnected ordered sets are max-reconstructible
- Examples on ordered set reconstruction
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- Pseudo-similar points in ordered sets
- On ordered sets with isomorphic marked maximal cards
This page was built for publication: More examples on ordered set reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827677)