| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656515 | Journal of Combinatorial Theory, Series A | 2006 | 26 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
