scientific article; zbMATH DE number 458873

MaRDI QIDQ3142912zbMATH OpenFDO

Authors Jean Guillaume Hagendorf, Gérard Lopez

Publication date 9 January 1994

zbMATH Keywords

anti-isomorphic relationsconverse of a relationreconstructible relations

Mathematics Subject Classification ID

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

Recommendations

• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• La relation différence et l'anti‐isomorphie
• scientific article; zbMATH DE number 4075060
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• La dualité dans la demi-reconstruction des relations binaires finies

Cited in

(22)

• The \(C_{3}\)-structure of the tournaments.
• The \((\leq 5)\)-hypomorphy of digraphs up to complementation
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Finite orders which are reconstructible up to duality by their comparability graphs
• \((\leq k)\)-reconstructible binary relations
• Hypomorphy of graphs up to complementation
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• scientific article; zbMATH DE number 4075060 (Why is no real title available?)
• scientific article; zbMATH DE number 4075061 (Why is no real title available?)
• The \((\leq 6)\)-half-reconstructibility of digraphs
• Prechains and self duality
• La dualité dans la demi-reconstruction des relations binaires finies
• La relation différence et l'anti‐isomorphie
• Description of the orders which are hereditarily half-reconstructible by their comparability graphs
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• 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
• The 3-forced 2-structures
• The half-isomorphy and the finite strongly connected tournaments
• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
• ( k)-half-reconstructible tournaments for k 6

This page was built for publication:

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