A note on non-isomorphic edge-color classes in random graphs
Abstract
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 Erdos-R\'enyi random graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.