Disconnected ordered sets are max-reconstructible

DOI10.1007/S11083-008-9104-6MaRDI QIDQ1016091zbMATH OpenOpenAlexFDO

Authors Marta Przyborowska, Aleksander Rutkowski

Publication date 4 May 2009

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-008-9104-6

zbMATH Keywords

cardconnectednessdeckrecognitionreconstructionsupercomponent

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Review text

In this paper, the authors deal with questions of which ordered sets are reconstructible and whether the disconnected posets are max-reconstructible, and provide a positive solution proving that every finite disconnected ordered set is max-reconstructible.

Recommendations

• Examples on ordered set reconstruction
• Ordered sets that are reconstructible from two cards and the number of comparabilities.
• On ordered sets with isomorphic marked maximal cards
• More examples on ordered set reconstruction
• Towards the reconstruction of posets

Cites work

• What is reconstruction for ordered sets?

This page was built for publication: Disconnected ordered sets are max-reconstructible

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016091)