Skip to main content
SpringerLink
Log in

Disconnected Ordered Sets are Max-Reconstructible

  • Published:
Order Aims and scope Submit manuscript

Abstract

Every finite disconnected set P is determined (up to automorphism) by the family {P − {a}:a ∈ Max P }.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rampon, J.-X.: What is reconstruction for ordered sets. Discrete Math. 291, 191–233 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Rival, I.: Unsolved problems. Order 1, 103–105 (1984)

    Article  MathSciNet  Google Scholar 

  3. Sands, B.: Unsolved problems. Order 1, 311–313 (1985)

    Article  MathSciNet  Google Scholar 

  4. Schrőder, B.S.W.: Ordered Sets, An Introduction. Birkhauser, Boston (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Information Science, Warsaw University of Technology, pl. Politechniki 1, 00-661, Warsaw, Poland

    Marta Przyborowska & Aleksander Rutkowski

Authors
  1. Marta Przyborowska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksander Rutkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aleksander Rutkowski.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Przyborowska, M., Rutkowski, A. Disconnected Ordered Sets are Max-Reconstructible. Order 26, 23–29 (2009). https://doi.org/10.1007/s11083-008-9104-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-008-9104-6

Keywords

Search

Navigation