Automorphism groups and Ramsey properties of sparse graphs

DOI10.1112/PLMS.12238MaRDI QIDQ5237377zbMATH OpenOpenAlexWikidataFDO

Authors David M. Evans, Jan Hubička, J. Nešetřil

Publication date 17 October 2019

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.01165, http://hdl.handle.net/10044/1/67998

zbMATH Keywords

extremely amenable automorphism groupstructural Ramsey theory

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Density (toughness, etc.) (05C42) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Infinite automorphism groups (20B27) Groups as automorphisms of other structures (22F50) Dynamical systems involving transformations and group actions with special properties (minimality, distality, proximality, expansivity, etc.) (37B05)

Abstract: We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todorv{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.

Recommendations

• Automorphism groups of generic structures: extreme amenability and amenability
• Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs
• Automorphism groups of countably categorical linear orders are extremely amenable
• Universal minimal flows of automorphism groups
• More universal minimal flows of groups of automorphisms of uncountable structures

Cited in

(15)

• Fixed points in compactifications and combinatorial counterparts
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
• Automorphism groups of countably categorical linear orders are extremely amenable
• The automorphism group of random graphs with a given number of edges
• CORES OVER RAMSEY STRUCTURES
• All those EPPA classes (strengthenings of the Herwig-Lascar theorem)
• Canonical functions: a proof via topological dynamics
• Ramsey properties and extending partial automorphisms for classes of finite structures
• Sparse graphs and the fixed points on type spaces property
• Smooth approximations and CSPs over finitely bounded homogeneous structures
• Forbidden cycles in metrically homogeneous graphs
• Ramsey expansions of metrically homogeneous graphs
• Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
• Flows of linear orders on sparse graphs.
• In praise of homomorphisms

This page was built for publication: Automorphism groups and Ramsey properties of sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237377)