Location: HILL 705
Date & time: Monday, 30 October 2017 at 2:00PM - 3:00PM
Abstract: We are concerned with the following Ramsey-type question: if the edges of a graph G are r-colored (not necessarily properly), what is the largest monochromatic component (or path, or cycle) which must appear? We may also ask for a cover or a partition of the vertex set of G by few monochromatic pieces.
We discuss some recent work addressing these questions when G is a random graph.
This is joint work with Michael Anastos and Louis DeBiasio.