Ramsey expansions of metrically homogeneous graphs
Andr\'es Aranda, David Bradley-Williams, Jan Hubi\v{c}ka, Miltiadis Karamanlis, Michael Kompatscher, Mat\v{e}j Kone\v{c}n\'y, Micheal Pawliuk

TL;DR
This paper studies Ramsey expansions, EPPA, and stationary independence in metrically homogeneous graphs, providing a comprehensive classification and new completion algorithms that impact automorphism group properties.
Contribution
It offers a classification of Ramsey expansions and related properties for all classes of metrically homogeneous graphs, introducing a canonical completion algorithm.
Findings
Most metric spaces in Cherlin's catalogue have precompact Ramsey expansions.
Characterization of stationary independence relation and EPPA for these classes.
Implications for automorphism groups include amenability, ergodicity, and property (FA).
Abstract
We investigate Ramsey expansions, the coherent extension property for partial isometries (EPPA), and the existence of a stationary independence relation for all classes of metrically homogeneous graphs from Cherlin's catalogue. We show that, with the exception of tree-like graphs, all metric spaces in the catalogue have precompact Ramsey expansions (or lifts) with the expansion property. With two exceptions we can also characterise the existence of a stationary independence relation and coherent EPPA. Our results are a contribution to Ne\v{s}et\v{r}il's classification programme of Ramsey classes and can be seen as empirical evidence of the recent convergence in techniques employed to establish the Ramsey property, the expansion property, EPPA and the existence of a stationary independence relation. At the heart of our proof is a canonical way of completing edge-labelled graphs to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
