arXiv (All)
open access
Reconstruction of Finite Posets of Width Three
We prove that every finite ordered set of width at most three and cardinality at least four is reconstructible from its deck. This settles the width-three part of an open problem posed by Schröder in Ordered Sets; the separate question concerning ordered sets of height one is not addressed here. The
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture#997773
- Avoidability of Digraphs with Height Functions and Orientations of $C_4$#1083811
- Every cubic graph has four total dominating sets covering each vertex at most twice#1345273
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- The Kelly--Trotter conjecture and dimension of poset products#1106140
Record · ID 1296697
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive