Abstract
In this paper, we compute universal minimal flows of groups of automorphisms of uncountable -homogeneous graphs, -free graphs, hypergraphs, partially ordered sets, and their extensions with an -homogeneous ordering. We present an easy construction of such structures, expanding the jungle of extremely amenable groups.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.