Abstract
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs G G , either (i) there is a countably-infinite tournament K K such that G ⊈ K G\not \subseteq K , or (ii) every countably-infinite tournament contains a spanning copy of G G . Furthermore, we are able to give a concise characterization of such oriented graphs. Our characterization becomes even simpler in the case of transitive acyclic oriented graphs (i.e. strict partial orders). For uncountable oriented graphs, we are able to extend the dichotomy result mentioned above to all regular cardinals κ \kappa ; however, we are only able to provide a concise characterization in the case when κ = ℵ 1 \kappa =\aleph _1 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
