Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Online/Virtual |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Given an r-coloring of the edges of a graph or hypergraph, how many edges must the largest monochromatic connected component contain? In this talk, I give an overview of some of my work on several versions of this problem (the complete graph setting with David Conlon and Mykhaylo Tyomkyn; the complete k-uniform hypergraph setting with Lyuben Lichev; and the sparse random graph setting with Hannah Fox), highlighting the proof ideas used, particularly in recent developments in the sparse random graph setting.
No Notes/Supplements Uploaded No Video Files Uploaded