Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms

DOI10.1002/malq.19990450313zbMath0929.05039OpenAlexW2044771984MaRDI QIDQ4264542

Youssef Boudabbous

Publication date: 21 October 1999

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19990450313

zbMATH Keywords

permutation groupstournamentsisomorphismreconstructionhemimorphismgroup of hemimorphisms

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

\((-2)\)-monohemimorphic graphs

Cites Work

• Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Transitivity of finite permutation groups on unordered sets
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms