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

Patrick Bennett, Ryan Cushman, Andrzej Dudek +1

For a graph $G$, let $\tau (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 o…