Rélations non reconstructibles par leurs restrictions

DOI10.1016/0095-8956(79)90039-XzbMath0322.04002OpenAlexW1970652610MaRDI QIDQ1223295

Maurice Pouzet

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90039-x

zbMATH Keywords

BINARY MULTIRELATIONMOEBIUS STRIPRECONSTRUCTIBSET THEORY

Mathematics Subject Classification ID

Graph theory (05C99) Structure theory of algebraic structures (08A05) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items (13)

Unnamed Item ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ La reconstruction au sens de Ulam de certaines multirelations binaires. (The reconstruction in Ulam's sense of some binary multirelations) ⋮ The reconstruction of multirelations, at least one component of which is a chain ⋮ What is reconstruction for ordered sets? ⋮ Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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)

Cites Work

• A congruence theorem for trees
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Transitivity of finite permutation groups on unordered sets
• Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
• On reconstruction of graphs
• Set-Transitive Permutation Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rélations non reconstructibles par leurs restrictions