Extending partial automorphisms of n-partite tournaments

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10404797" target="_blank" >RIV/00216208:11320/19:10404797 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=qoRx.DnkWp" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=qoRx.DnkWp</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Extending partial automorphisms of n-partite tournaments
Original language description
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 Gthere 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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GJ18-13685Y" target="_blank" >GJ18-13685Y: Model thoery and extremal combinatorics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)