( k)-reconstructible binary relations

DOI10.1016/J.EJC.2013.07.010MaRDI QIDQ2434745zbMATH OpenOpenAlexFDO

Authors Youssef Boudabbous, Christian Delhommé

Publication date 7 February 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2013.07.010

zbMATH Keywords

Fraïssé-hypomorphic relations

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Procédé de construction des relations binaires non (≤ 3)-reconstructibles
• scientific article; zbMATH DE number 4075060
• The minimal non-( k)-reconstructible relations
• La dualité dans la demi-reconstruction des relations binaires finies
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II

Cites work

• Decomposition of Directed Graphs
• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 1201510 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (Why is no real title available?)
• scientific article; zbMATH DE number 3375499 (Why is no real title available?)
• scientific article; zbMATH DE number 3394133 (Why is no real title available?)
• L'Indeformabilite des Relations et Multirelations Binaires
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• La dualité dans la demi-reconstruction des relations binaires finies
• Prechains and self duality
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
• The minimal non-( k)-reconstructible relations
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic

Cited in

(16)

• The minimal non-( k)-reconstructible relations
• Dependency relations
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• On a Reconstruction of Models with Only One Binary Relation
• Prechains and self duality
• La dualité dans la demi-reconstruction des relations binaires finies
• scientific article; zbMATH DE number 1740046 (Why is no real title available?)
• Sur la détermination d'une relation binaire à partir d'informations locales
• Procédé de construction des relations binaires non (≤ 3)-reconstructibles
• \((\leq k)\)-hereditarily reconstructible digraphs
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• F3-Reconstruction and Bi-Founded 2-Structures
• Description of the ( 3)-hypomorphic posets and bichains. Application to the ( 3)-reconstruction.
• Characterisation of \(d\)-demi-reconstructible finite binary relations
• The \((-5)\)-demi-reconstructibility of finite related binary relations
• The threshold for top-down reconstructibility modulo the duality of finite binary relations

This page was built for publication: \((\leq k)\)-reconstructible binary relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434745)