论文标题
随机图中的非同构边缘颜色类的注释
A note on non-isomorphic edge-color classes in random graphs
论文作者
论文摘要
对于图$ g $，令$τ（g）$是最大颜色数量，因此存在$ g $的边缘色，没有两个颜色类是同构。当$ g = g（n，p）$是经典的erdős-rényi随机图时，我们研究$τ（g）$的行为。
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.
