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

Patrick Bennett; Ryan Cushman; Andrzej Dudek; Elizabeth Sprangel

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

Combinatorics 2023-01-12 v2

Authors: Patrick Bennett , Ryan Cushman , Andrzej Dudek , Elizabeth Sprangel

Abstract

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 of $\tau(G)$ when $G=G(n, p)$ is the classical Erd\H{o}s-R\'enyi random graph.

Keywords

graph coloring rainbow coloring random graphs

Cite

@article{arxiv.2210.02301,
  title  = {A note on non-isomorphic edge-color classes in random graphs},
  author = {Patrick Bennett and Ryan Cushman and Andrzej Dudek and Elizabeth Sprangel},
  journal= {arXiv preprint arXiv:2210.02301},
  year   = {2023}
}

Related papers

View all related →