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

Turan Numbers and the Szabo Calculus

  • Start Date: October 4, 2023
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Quentin Dubroff - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    How many edges can an n-vertex graph have if it contains no copy of a cycle on 4 vertices? A nice and simple argument shows that the answer is at most 10n^{3/2}, but is this a good upper bound? I'll describe how one might find the algebraic construction showing that it is, and then I'll survey how similar constructions can (or cannot) be used for related problems.