What is reconstruction for ordered sets?
From MaRDI portal
Publication:1772277
DOI10.1016/j.disc.2004.04.029zbMath1062.03045OpenAlexW1971832060MaRDI QIDQ1772277
Publication date: 18 April 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.029
survey paperMorphologyPosetBinary relationFraïssé-reconstructionSet-reconstructionUlam-reconstruction
Combinatorics of partially ordered sets (06A07) Other classical set theory (including functions, relations, and set algebra) (03E20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (10)
Unnamed Item ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Set recognition of decomposable graphs and steps towards their reconstruction ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Ordered sets that are reconstructible from two cards and the number of comparabilities. ⋮ Reconstruction of small graphs and digraphs ⋮ Pseudo-similar points in ordered sets ⋮ Definability in substructure orderings. II: Finite ordered sets ⋮ Disconnected ordered sets are max-reconstructible ⋮ Set-reconstructibility of Post classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructibility and perfect graphs
- An obvious proof of Fishburn's interval order theorem
- A congruence theorem for trees
- On rigid circuit graphs
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- Rélations non reconstructibles par leurs restrictions
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- A counterexample about poset reconstruction
- Width two posets are reconstructible
- Indecomposable graphs
- Reconstruction of finite truncated semi-modular lattices
- Reconstruction of posets with the same comparability graph
- On ordered sets with isomorphic marked maximal cards
- Towards the reconstruction of posets
- Examples on ordered set reconstruction
- Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- A simpler counterexample to the reconstruction conjecture for denumerable graphs
- Reconstructing the degree pair sequence of a digraph
- The falsity of the reconstruction conjecture for tournaments
- Ordres "C.A.C."
- Graph reconstruction—a survey
- L'Indeformabilite des Relations et Multirelations Binaires
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
- Transitiv orientierbare Graphen
- On the Structure of Finite T0 + T5 Spaces
- Reconstruction of the neighborhood deck of an ordered set
- Reconstruction of N-free ordered sets
This page was built for publication: What is reconstruction for ordered sets?
