pith. sign in

arxiv: 1808.06121 · v1 · pith:Q63GQYXZnew · submitted 2018-08-18 · 🧮 math.LO

The structure of random automorphisms of the random graph

classification 🧮 math.LO
keywords nullrandomclassesconjugacyeverygraphnon-haarautomorphism
0
0 comments X
read the original abstract

We give a complete description of the size of the conjugacy classes of the automorphism group of the random graph with respect to Christensen's Haar null ideal. It is shown that every non-Haar null class contains a translated copy of a nonempty portion of every compact set and that there are continuum many non-Haar null conjugacy classes. Our methods also yield a new proof of an old result of Truss.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.