Unavoidable structures in infinite tournaments

arXiv2301.04636MaRDI QIDQ6508397FDOQ6508397

Authors: Alistair Benford, Louis DeBiasio, Paul Larson 

Abstract: We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $GotsubseteqK$, or (ii) every countably-infinite tournament contains a spanning copy of $G$. Our characterization implies a corresponding result for transitive acyclic oriented graphs (i.e. strict partial orders). We also consider an extension of the above result to uncountable oriented graphs. Finally, we consider a problem of a slightly different nature; that is, which oriented graphs are guaranteed to appear in tournaments on $mathbbN$ with a sufficient density of forward edges.

This page was built for publication: Unavoidable structures in infinite tournaments

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