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

Induced Subdivisions and Polylogarithmic Chromatic Number

  • Start Date: October 7, 2024
  • Event Start Time: 2:00 PM
  • Event End Time: 3:00 PM
  • Seminar Series: Rutgers Discrete Mathematics Seminar
  • Presenter(s): Tung H Nguyen - Princeton University
  • Event Location: Conference Room 705 | Rutgers University | Hill Center | 110 Frelinghuysen Rd
  • Event Additional Info: <p>See:&nbsp;<a href="https://sites.google.com/view/rutgersdmseminar">https://sites.google.com/view/rutgersdmseminar</a></p>
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    We discuss a proof that for every graph H, every n-vertex graph with no induced subdivision of H and with bounded clique number has chromatic number at most polylog(n). This extends a result of Fox and Pach that similar polylogarithmic bounds hold for all string graphs, and is close to optimal as there are triangle-free n-vertex string graphs with chromatic number at least loglog n. Joint work with Alex Scott and Paul Seymour.