Monochromatic components with many edges in random graphs

Hannah Fox, Sammy Luo

In an $r$-coloring of edges of the complete graph on $n$ vertices, how many edges are there in the largest monochromatic connected component? A construction of Gyárfás shows that…