Abstract
We prove a necessary condition for two nonisomorphic ordered sets to have two isomorphic marked maximal cards. This condition is used to prove that ordered sets of width 3 with 2 maximal elements are reconstructible and that ordered sets of width 3 are reconstructible if we can reconstruct the marked maximal deck.
Similar content being viewed by others
References
Bollobás, B.: Almost every graph has reconstruction number three, J.Graph Theory 14 (1990), 1–4.
Hughes, J.: Reconstruction of small ordered sets, MS thesis, Louisiana Tech University, 2003.
Kleitman, D. J. and Rothschild, B. L.: Asymptotic enumeration of partial orders on a finite set, Trans.Amer.Math.Soc. 205 (1975), 205–220.
Kratsch, D. and Rampon, J.-X.: A counterexample about poset reconstruction, Order 11 (1994), 95–96.
Kratsch, D. and Rampon, J.-X.: Towards the reconstruction of posets, Order 11 (1994), 317–341.
Kratsch, D. and Rampon, J.-X.: Width two posets are reconstructible, Discrete Math. 162, (1996), 305–310.
Rampon, J.-X.: What is reconstruction for ordered sets?, In: Proceedings of the Fraïssé 2000 Conference, 2001.
Rampon, J.-X. and Schröder, B.: Reconstruction of truncated semi-modular lattices, J.Combin.Theory Ser.B 86 (2002), 254–272.
Sands, B.: Unsolved problems, Order 1 (1985), 311–313.
Schröder, B.: Reconstruction of the neighborhood deck of ordered sets, Order 17 (2000), 255–269.
Schröder, B.: Reconstruction of N-free ordered sets, Order 18 (2001), 61–68.
Schröder, B.: Ordered Sets – An Introduction, Birkhäuser, Boston, 2002.
Schröder, B.: Examples on ordered set reconstruction, Order 19 (2002), 283–294.
Schröder, B.: More examples on ordered set reconstruction, to appear in Discrete Math. (2002).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schröder, B.S.W. On Ordered Sets with Isomorphic Marked Maximal Cards. Order 20, 299–327 (2003). https://doi.org/10.1023/B:ORDE.0000034587.50489.be
Issue Date:
DOI: https://doi.org/10.1023/B:ORDE.0000034587.50489.be