A note on non-isomorphic edge-color classes in random graphs

For a graph $G$, let $τ(G)$ be the maximum number of colors such that there exists an edge-coloring of $G$ with no two color classes being isomorphic. We investigate the behavior of $τ(G)$ when $G=G(n, p)$ is the classical Erdős-Rényi random graph.

No reviews yet.

No comments yet.