Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Reconstruction of N-free Ordered Sets

  • Published:
Order Aims and scope Submit manuscript

Abstract

We prove that N-free ordered sets are reconstructible.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Basso-Gerbelli, M. and Ille, P. (1993) La reconstruction des relations définis par interdits, C.R. Acad. Sci. Paris Sér. I 316, 1229–1234.

    Google Scholar 

  2. Ille, P. (1993) Recognition problem in reconstruction for decomposable relations, N. W. Sauer et al. (eds.), Finite and Infinite Combinatorics in Sets and Logic, Kluwer Academic Publishers, Dordrecht, pp. 189–198.

    Google Scholar 

  3. Kratsch, D. and Rampon, J.-X. (1994) A counterexample about poset reconstruction, Order 11, 95–96.

    Google Scholar 

  4. Kratsch, D. and Rampon, J.-X. (1994) Towards the reconstruction of posets, Order 11, 317–341.

    Google Scholar 

  5. Kratsch, D. and Rampon, J.-X. (1996) Width two posets are reconstructible, Discrete Math. 162, 305–310.

    Google Scholar 

  6. Rampon, J.-X. and Schröder, B. (2000) Reconstruction of truncated semi-modular lattices, submitted to J. Combin. Theory (B).

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

    Google Scholar 

  8. Schröder, B. (2000) Reconstruction of the neighborhood deck of an ordered set, Order 17, 255–269.

    Google Scholar 

  9. Schröder, B. Ordered Sets-Underlying Structure and Unsolved Problems (working title), Birkhäuser, to be finished summer 2001.

Download references

Author information

Authors and Affiliations

  1. Program of Mathematics & Statistics, Louisiana Tech University, Ruston, LA, 71272, U.S.A.

    Bernd S. W. Schröder

Authors
  1. Bernd S. W. Schröder
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schröder, B.S.W. Reconstruction of N-free Ordered Sets. Order 18, 61–68 (2001). https://doi.org/10.1023/A:1010698416799

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010698416799

Search

Navigation