What is reconstruction for ordered sets?
type: Item
instance of: scholarly article
title: What is reconstruction for ordered sets?
zbMATH Open document ID: 1062.03045
author: Jean-Xavier Rampon
published in: Discrete Mathematics
publication date: 2005-04-18T00:00:00Z
Mathematics Subject Classification ID: 03E20
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 2157547
zbMATH Keywords: Binary relation
zbMATH Keywords: Morphology
zbMATH Keywords: Poset
zbMATH Keywords: Fraïssé-reconstruction
zbMATH Keywords: Ulam-reconstruction
zbMATH Keywords: Set-reconstruction
zbMATH Keywords: survey paper
MaRDI profile type: Publication
full work available at URL: j.disc.2004.04.029
OpenAlex ID: W1971832060
cites work: Q3136258
cites work: Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets
cites work: Q5532570
cites work: An obvious proof of Fishburn's interval order theorem
cites work: Q3975132
cites work: Graph reconstruction—a survey
cites work: Q4147995
cites work: On the Structure of Finite T0 + T5 Spaces
cites work: Q3941448
cites work: Q3941449
cites work: On rigid circuit graphs
cites work: Q5690768
cites work: Q3344239
cites work: A simpler counterexample to the reconstruction conjecture for denumerable graphs
cites work: Q5611770
cites work: Q4000222
cites work: Transitiv orientierbare Graphen
cites work: Q3816105
cites work: RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
cites work: Q5544087
cites work: Q4044629
cites work: Q5578819
cites work: Indecomposable graphs
cites work: Q4881848
cites work: Reconstruction of posets with the same comparability graph
cites work: A congruence theorem for trees
cites work: A counterexample about poset reconstruction
cites work: Towards the reconstruction of posets
cites work: Width two posets are reconstructible
cites work: Ordres "C.A.C."
cites work: Q4128824
cites work: L'Indeformabilite des Relations et Multirelations Binaires
cites work: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
cites work: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
cites work: Reconstructing the degree pair sequence of a digraph
cites work: Q3870936
cites work: Q5652693
cites work: Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
cites work: Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
cites work: Rélations non reconstructibles par leurs restrictions
cites work: Reconstruction of finite truncated semi-modular lattices
cites work: Reconstruction of the neighborhood deck of an ordered set
cites work: Q4791727
cites work: Reconstruction of N-free ordered sets
cites work: Examples on ordered set reconstruction
cites work: On ordered sets with isomorphic marked maximal cards
cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
cites work: The falsity of the reconstruction conjecture for tournaments
cites work: Q4004146
cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets
cites work: Q3259049
cites work: Reconstructibility and perfect graphs
DOI: 10.1016/J.DISC.2004.04.029
description: scientific article; zbMATH DE number 2157547