RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I

DOI10.1002/malq.19920380104zbMath0799.04001OpenAlexW2003123666MaRDI QIDQ4295208

Gérard Lopez, Claire Rauzy

Publication date: 11 July 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380104

zbMATH Keywords

binary relationreconstruction conjecturerestrictionshypomorphyreconstructibility of relations

Mathematics Subject Classification ID

Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items (18)

Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms ⋮ Finite tournaments with a nonempty diamonds' support ⋮ Unnamed Item ⋮ \(\{-1\}\)-self dual finite prechains and applications ⋮ The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ Prechains and self duality ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament ⋮ Indecomposability graph and indecomposability recognition ⋮ \((\leq k)\)-reconstructible binary relations ⋮ Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament). ⋮ The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\) ⋮ Unnamed Item ⋮ The minimal non-\((\leqslant k)\)-reconstructible relations ⋮ What is reconstruction for ordered sets? ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ Reconstruction of posets with the same comparability graph ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)

This page was built for publication: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I