Sur certains tournois reconstructibles application à leurs groupes d'automorphismes

DOI10.1016/0012-365X(78)90202-9zbMath0437.05025OpenAlexW2049432903MaRDI QIDQ1141147

Maurice Pouzet

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90202-9

zbMATH Keywords

isomorphismtransitive tournamentssubtournament

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments) ⋮ Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms ⋮ What is reconstruction for ordered sets? ⋮ \((-2)\)-monohemimorphic graphs ⋮ Reconstruction of posets with the same comparability graph ⋮ \(k\)-spectrally monomorphic tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey

This page was built for publication: Sur certains tournois reconstructibles application à leurs groupes d'automorphismes