dimacs logo color

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

Events

Seminar Details

The Chvátal-Rödl-Szemerédi-Trotter Theorem

  • Start Date: March 10, 2021
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Rashmika Goswami - Rutgers University
  • Event Location: Online Event
  • Event Additional Info: Presented via Zoom - Meeting ID: 984 4140 9199https://rutgers.zoom.us/j/98441409199 Password: 715004 
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    The Ramsey number r(G) of a graph G is the minimum number n such that any two-coloring of the edges of a complete graph on n vertices will contain a monochromatic copy of G. It is known that for the complete graph, r(K_n) grows exponentially in n. However, for graphs of bounded degree, Chvátal, Rödl, Szemerédi, and Trotter showed that this number is (asymptotically) much smaller. This result also illustrates a nice application of Szemerédi's Regularity Lemma.