La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
From MaRDI portal
Publication:1864566
DOI10.1006/eujc.2001.0562zbMath1014.03051OpenAlexW1994644270MaRDI QIDQ1864566
Publication date: 18 March 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2001.0562
Other classical set theory (including functions, relations, and set algebra) (03E20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (11)
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Unnamed Item ⋮ The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ Prechains and self duality ⋮ \((\leq k)\)-reconstructible binary relations ⋮ Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs) ⋮ \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) ⋮ Unnamed Item ⋮ The minimal non-\((\leqslant k)\)-reconstructible relations ⋮ The 2-reconstructible indecomposable graphs. ⋮ 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
- Theory of relations. Transl. from the French by P. Clote
- Rélations non reconstructibles par leurs restrictions
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- The falsity of the reconstruction conjecture for tournaments
- L'Indeformabilite des Relations et Multirelations Binaires
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- Transitiv orientierbare Graphen
This page was built for publication: La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
