\((\leq k)\)-reconstructible binary relations

DOI10.1016/j.ejc.2013.07.010zbMath1282.05048OpenAlexW2031958955MaRDI QIDQ2434745

Christian Delhommé, Youssef Boudabbous

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)

Related Items (4)

Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Dependency relations ⋮ Unnamed Item ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prechains and self duality
• The minimal non-\((\leqslant k)\)-reconstructible relations
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Decomposition of Directed Graphs
• L'Indeformabilite des Relations et Multirelations Binaires
• 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) I
• RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES

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