Automorphism groups and Ramsey properties of sparse graphs
364 views · Published 1 February 2018 · 54:05 · Indexed 20 November 2026
Channel: Institut Henri Poincaré · 2018 · Science & Technology
By David Evans (Imperial) Abstract: An infinite graph is sparse if there is a positive integer k such that for every finite subgraph, the number of edges is bounded above by k times the number of vertices. Such graphs arise in model theory via Hrushovskis predimension constructions. In joint work with J. Hubiˇcka and J. Neˇsetˇril, we study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todorcevic correspondence. We investigate amenable and extremely amenable subgroups of these groups using the ‘space of k-orientations’ of the graph and results from structural Ramsey theory. In particular, we show that Hrushovskis example of an omega-categorical sparse graph has no omega-categorical expansion with an extremely amenable automorphism group, thereby providing a counterexample to a conjecture in the area.
More from this channel
-
29:47
10 ans du Groupe Calcul : Histoire du Calcul - Introduction
-
52:14
Gauss, Jacobi, Seidel, Richardson, Krylov: the Invention of Iterative Methods
-
55:33
Les "invariants arithmétiques" de H. Poincaré
-
1:08:53
Henri Poincaré, a founding father of the modern theory of PDEs
-
57:13
Sympletic topology from Poincaré to Gromov
-
57:35
Structural Realism, Then and Now
-
46:26
Poincaré inequalities in probability and geometric analysis
-
1:02:05
On the contributions of Henri Poincaré to modern geophysics...