Infinite partitions of random graphs

We determine the set of canonical equivalence relations on [G]n, where G is a random graph, extending the result of Erdős and Rado for the integers to random graphs.