Conjugacy for homogeneous ordered graphs

DOI10.1007/s00153-018-0645-0zbMath1477.03185arXiv1804.04609OpenAlexW2796771074WikidataQ129265446 ScholiaQ129265446MaRDI QIDQ1734273

Paul Ellis, Samuel Coskey

Publication date: 27 March 2019

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

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

zbMATH Keywords

conjugacyhomogeneous structureordered graphsBorel complexity

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Descriptive set theory (03E15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Graph theory (05C99) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The conjugacy problem for the automorphism group of the random graph
• Katětov functors
• A survey of homogeneous structures
• The conjugacy problem for automorphism groups of countable homogeneous structures
• The conjugacy problem for automorphism groups of homogeneous digraphs
• Homogeneous Ordered Graphs, Metrically Homogeneous Graphs, and Beyond

This page was built for publication: Conjugacy for homogeneous ordered graphs