Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Monochromatic Components in Random Graphs

Deepak Bal, Montclair State University

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.


Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.