2000 character limit reached
Automorphism groups and Ramsey properties of sparse graphs (1801.01165v5)
Published 3 Jan 2018 in math.GR, cs.DM, math.CO, math.DS, and math.LO
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.