Dept Banner
Dept Banner


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.


Contact Us

HillCenter small

Department of Mathematics

Department of Mathematics
Rutgers University
Hill Center - Busch Campus
110 Frelinghuysen Road
Piscataway, NJ 08854-8019, USA

Phone: +1.848.445.2390
Fax: +1.732.445.5530