The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
DOI10.1090/memo/0621zbMath0978.03029OpenAlexW4229866260MaRDI QIDQ4387554
Publication date: 13 May 1998
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0621
relational structurehomogeneous structuresdecision procedurecountable homogeneous tournamentsage of an infinite structureclassification of countable homogeneous directed graphsclassification of countable homogeneous undirected graphsuniversal homogeneous partial order
Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20) Models with special properties (saturated, rigid, etc.) (03C50) Quantifier elimination, model completeness, and related topics (03C10) Model theory of denumerable and separable structures (03C15) Infinite automorphism groups (20B27) Multiply transitive infinite groups (20B22)
Related Items (75)
This page was built for publication: The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments