dimacs logo color

Events

Event Calendar

« Previous Month

August 2026

Next Month »
Sun Mon Tue Wed Thu Fri Sat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Seminar Details

Monochromatic Components in Random Graphs

  • Start Date: October 30, 2017
  • Event Start Time: 2:00 PM
  • Event End Time: 3:00 PM
  • Seminar Series: Rutgers Discrete Mathematics Seminar
  • Presenter(s): Deepak Bal - Montclair State University
  • Event Location: Hill Center-Room 705
  • Presentation Type: Stand Alone Presentation
  • 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.