On the classification of vertex-transitive structures

DOI10.1007/s00153-018-0651-2zbMath1477.03184arXiv1707.02383OpenAlexW2735253502MaRDI QIDQ2312084

Samuel Coskey, Stephanie Potter, John D. Clemens

Publication date: 4 July 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02383

zbMATH Keywords

linear ordersgraphstournamentsBorel complexity theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Related Items (1)

New jump operators on equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Isomorphism of homogeneous structures
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• An absoluteness principle for Borel sets
• The Structure of Hyperfinite Borel Equivalence Relations
• Infinite time Turing machines

This page was built for publication: On the classification of vertex-transitive structures