Extending partial automorphisms of n-partite tournaments

MaRDI QIDQ6315813zbMATH OpenFDO

Authors Jan Hubička, Colin Jahel, Matěj Konečný, Marcin Sabok

Publication date 18 March 2019

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Group actions on combinatorial structures (05E18) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Abstract: We prove that for every $ngeq2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite $n$-partite tournament $H$ such that every isomorphism of induced subgraphs of $G$ extends to an automorphism of $H$. Our constructions are purely combinatorial (whereas many earlier EPPA results use deep results from group theory) and extend to other classes such as the class of all finite semi-generic tournaments.

This page was built for publication: Extending partial automorphisms of $n$-partite tournaments

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