La dualité dans la demi-reconstruction des relations binaires finies

DOI10.1016/S0764-4442(99)80033-0zbMath0916.04003MaRDI QIDQ4235412

Jamel Dammak

Publication date: 20 June 1999

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite tournamentsfinite binary relationshalf-reconstructibility

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items (4)

The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ Prechains and self duality ⋮ \((\leq k)\)-reconstructible binary relations ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

This page was built for publication: La dualité dans la demi-reconstruction des relations binaires finies