Richard P. Stanley Seminar in Combinatorics: Seeded embeddings, and Ramsey numbers of bipartite graphs of small bandwidth

Name: Richard P. Stanley Seminar in Combinatorics: Seeded embeddings, and Ramsey numbers of bipartite graphs of small bandwidth
Start: 2024-09-26T16:00:00-04:00
End: 2024-09-26T17:00:00-04:00
Location: MIT, Room 2-139

SEMINARS: HARVARD-MIT COMBINATORICS

When: September 26, 2024

4:00 pm - 5:00 pm

Where: MIT, Room 2-139

Speaker: Konstantin Tikhomirov - CMU

In this talk, I will discuss some estimates for the Ramsey numbers of bipartite graphs of sublinear bandwidth and with growing degrees. The estimates are obtained by applying a “seeded” version of dependent random choice. The talk is based on a joint work (in progress) with Dylan Altschuler and Han Huang.

For information about the Richard P. Stanley Seminar in Combinatorics, visit https://math.mit.edu/combin/