2006/11/22 by Reinhard Diestel, Imre Leader, Alex Scott +1 · 7 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Advanced Topology and Set Theory #Mathematics #Combinatorics #Random graph #Discrete mathematics #Comparability graph #Symmetric graph #Tournament #Block graph #Line graph #Vertex-transitive graph #Null graph #Graph #Voltage graph #Pathwidth
paper · pdf · doi:10.1090/s0002-9947-06-04086-4
published in Transactions of the American Mathematical Society 359(5), 2395-2405 (American Mathematical Society)
openalex publication_date 2006/11/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/02
We classify the countably infinite oriented graphs which, for every partition of their vertex set into two parts, induce an isomorphic copy of themselves on at least one of the parts. These graphs are the edgeless graph, the random tournament, the transitive tournaments of order type ω α, and two orientations of the Rado graph: the random oriented graph, and a newly found random acyclic oriented graph.