Automorphism groups and Ramsey properties of sparse graphs
classification
🧮 math.GR
cs.DMmath.COmath.DSmath.LO
keywords
amenableautomorphismgroupssparsecategoricalextremelygraphgraphs
pith:FMXMNRDF Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{FMXMNRDF}
Prints a linked pith:FMXMNRDF badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todor\v{c}evi\'c correspondence. We investigate amenable and extremely amenable subgroups of these groups using the space of orientations of the graph and results from structural Ramsey theory. Resolving one of the open questions in the area, we show that Hrushovski's example of an $\omega$-categorical sparse graph has no $\omega$-categorical expansion with extremely amenable automorphism group.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.