2019/03/18 by Jan Hubička, Colin Jahel, Hubička, Jan +5
Computer Science · Mathematics · #05C60 #05E18 #Advanced Topology and Set Theory #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #G.2.2 #Group Theory (math.GR) #Primary: 05C20 #Secondary: 20B25 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1903.07476
openalex publication_date 2019/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We prove that for every n≥ 2 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.