A Note on Non-Isomorphic Edge-Color Classes in Random Graphs

期刊论文
发表日期：

2024年11月19日

查看全文

Patrick Bennett,
Ryan Cushman,
Andrzej Dudek,
Elizabeth Sprangel

摘要

For a graph G, let $\tau (G)$ $τ (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 $\tau (G)$ $τ (G)$ when $G=G(n, p)$ $G = G (n, p)$ is the classical Erdős-Rényi random graph.